aboutsummaryrefslogtreecommitdiff
path: root/pseudo_palindrome_binary_tree.cpp
blob: 63b2cac9ed44d6dac7485032bba1181506b43d60 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
#include "leetcode.h"

class Solution {
public:
  int pseudoPalindromicPaths(TreeNode *root) {
    vector<int> v(10, 0);
    dfs(root, v);
    return count;
  }

private:
  int count = 0;
  void dfs(TreeNode *root, vector<int> v) {
    if (root == NULL)
      return;
    v[root->val]++;
    if (root->left == NULL && root->right == NULL) {
      int oddCount = 0;
      for (auto x : v)
        if (x % 2)
          oddCount++;
      if (oddCount <= 1)
        count++;
      return;
    }
    dfs(root->left, v);
    dfs(root->right, v);
  }
};