-
Notifications
You must be signed in to change notification settings - Fork 7
/
Main.java
53 lines (49 loc) · 1.26 KB
/
Main.java
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
package com.company;
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode() {}
TreeNode(int val) { this.val = val; }
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
public class Main {
public static void main(String[] args) {
TreeNode a = new TreeNode(2);
TreeNode b = new TreeNode(1);
TreeNode c = new TreeNode(1);
TreeNode d = new TreeNode(1);
TreeNode e = new TreeNode(3);
TreeNode f = new TreeNode(1);
a.left = b;
a.right = c;
b.left = d;
b.right = e;
e.right = f;
pseudoPalindromicPaths(a);
}
static int res;
static int[] count;
public static int pseudoPalindromicPaths (TreeNode root) {
count = new int[10];
dfs(root);
return res;
}
public static void dfs(TreeNode node){
if(node == null) return;
count[node.val]++;
if(node.left == node.right){
int countOdd = 0;
for (int num : count)
countOdd += num % 2 == 0 ? 0 : 1;
if(countOdd < 2) res++;
}
dfs(node.left);
dfs(node.right);
count[node.val]--;
}
}