leetcode

0

1 class Solution {

2 int count[10] = {0};

3

4 public:

5 int pseudoPalindromicPaths(TreeNode *root) {

6 int res = 0;

7

8 count[root->val]++;

9 if (!root->left && !root->right) {

10 int odd = 0;

11 for (int i = 1; i <= 9; i++)

12 if (count[i] % 2 && odd++) break;

13 res = odd <= 1;

14 } else {

15 if (root->left) res += pseudoPalindromicPaths(root->left);

16 if (root->right) res += pseudoPalindromicPaths(root->right);

17 }

18 count[root->val]--;

19

20 return res;

21 }

22 };