-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
971.java
82 lines (73 loc) · 2.26 KB
/
971.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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
__________________________________________________________________________________________________
sample 0 ms submission
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
List<Integer> res = new ArrayList<>();
int i = 0;
public List<Integer> flipMatchVoyage(TreeNode root, int[] voyage) {
if (dfs(root, voyage)) return res;
res.clear();
res.add(-1);
return res;
}
private boolean dfs(TreeNode node, int[] voyage) {
if (node == null) return true;
if (node.val != voyage[i++]) return false;
if (node.left != null && node.left.val != voyage[i]) {
res.add(node.val);
return dfs(node.right, voyage) && dfs(node.left, voyage);
}
return dfs(node.left, voyage) && dfs(node.right, voyage);
}
}
__________________________________________________________________________________________________
sample 37992 kb submission
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<Integer> flipMatchVoyage(TreeNode root, int[] voyage) {
List<Integer> result=new ArrayList<>();
Stack<TreeNode> stack=new Stack<>();
stack.push(root);
int i=0;
while(stack.size()>0)
{
TreeNode node=stack.pop();
if(node==null)
continue;
if(node.val!=voyage[i++])
return Arrays.asList(-1);
if(node.right!=null && node.right.val==voyage[i])
{
if(node.left!=null)
{
result.add(node.val);
}
stack.push(node.left);
stack.push(node.right);
}
else
{
stack.push(node.right);
stack.push(node.left);
}
}
return result;
}
}
__________________________________________________________________________________________________