LeetCode/Java/783.java at master · strengthen/LeetCode · GitHub

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
__________________________________________________________________________________________________
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 {

    public int minDiffInBST(TreeNode root) {
        inOrder(root);
        return min;
    }

     int min = Integer.MAX_VALUE;
     Integer prev = null;

    public void inOrder(TreeNode node){

        if(node==null)
            return;

        inOrder(node.left);

        if(prev!=null){
            min = Math.min(min,Math.abs(node.val-prev));
        }
        prev = node.val;
        inOrder(node.right);
    }

}
__________________________________________________________________________________________________
sample 35748 kb 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=0;
    int last=0;
    boolean first=false;
    public int minDiffInBST(TreeNode root) {
        min=Integer.MAX_VALUE;
        first=false;
        help(root);
        return min;
    }
    void help(TreeNode n){
        if (n==null) return;
        help(n.left);
        if (n.left==null  && !first){
            first=true;
        }else{
            min=Math.min(n.val-last, min);
        }
        last=n.val;
        help(n.right);
    }
}
__________________________________________________________________________________________________