leetcode-solution/Java/Solution270.java at main · e-chocolate/leetcode-solution · 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
/**
 * Definition for a binary tree node.
 * public 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;
 *     }
 * }
 */
class Solution270 {
    private int res;
    private double diff;

    public int closestValue(TreeNode root, double target) {
        diff = Math.abs(root.val - target);
        res = root.val;
        dfs(root, target);
        return res;
    }

    public void dfs(TreeNode root, double target) {
        if (root == null) return;
        double d = Math.abs(root.val - target);
        if (d < diff) {
            diff = d;
            res = root.val;
        } else if (d == diff) {
            res = Math.min(res, root.val);
        }
        dfs(root.left, target);
        dfs(root.right, target);
    }

    public void dfs(TreeNode root, double target) {
        if (root == null) return;
        double d = Math.abs(root.val - target);
        if (d < diff) {
            diff = d;
            res = root.val;
        } else if (d == diff) {
            res = Math.min(res, root.val);
        }
        if (root.val < target) dfs(root.right, target);
        else dfs(root.left, target);
    }
}