-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
530.java
57 lines (54 loc) · 1.64 KB
/
530.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
__________________________________________________________________________________________________
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 {
int min = Integer.MAX_VALUE;
TreeNode pre;
public int getMinimumDifference(TreeNode root) {
findMin(root);
return min;
}
private void findMin(TreeNode root) {
if(root == null) return;
getMinimumDifference(root.left);
if(pre != null) min = Math.min(min, Math.abs(root.val - pre.val));
pre = root;
getMinimumDifference(root.right);
}
}
__________________________________________________________________________________________________
sample 37744 kb submission
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
Integer ans;
public int getMinimumDifference(TreeNode root) {
ans = Integer.MAX_VALUE;
helper(root, null, null);
return ans;
}
// non-negative values
public void helper(TreeNode root, Integer max, Integer min) {
if(root==null) return ;
helper(root.left, root.val, min);
if(max!=null) ans = Math.min(ans, Math.abs(max-root.val));
if(min!=null) ans = Math.min(ans, Math.abs(root.val-min));
helper(root.right, max, root.val);
}
}
__________________________________________________________________________________________________