代码拉取完成,页面将自动刷新
package com.fishercoder.solutions;
import com.fishercoder.common.classes.TreeNode;
public class _270 {
public static class Solution1 {
//A general tree solution, this finished in 1 ms
public int closestValue(TreeNode root, double target) {
if (root == null) {
return 0;
}
double delta = Double.MAX_VALUE;
return dfs(root, target, delta, root.val);
}
private int dfs(TreeNode root, double target, double delta, int closestVal) {
if (Math.abs(root.val - target) < delta) {
closestVal = root.val;
delta = Math.abs(root.val - target);
}
int leftVal = closestVal;
if (root.left != null) {
leftVal = dfs(root.left, target, delta, closestVal);
}
int rightVal = closestVal;
if (root.right != null) {
rightVal = dfs(root.right, target, delta, closestVal);
}
return (Math.abs(leftVal - target) > Math.abs(rightVal - target)) ? rightVal : leftVal;
}
}
public static class Solution2 {
// BST solution
// we can tailor the solution to use the BST feature: left subtrees are always smaller than the root the right subtrees
//this finished in 0 ms
public int closestValue(TreeNode root, double target) {
if (root == null) {
return 0;
}
return dfs(root, target, root.val);
}
private int dfs(TreeNode root, double target, int minVal) {
if (root == null) {
return minVal;
}
if (Math.abs(root.val - target) < Math.abs(minVal - target)) {
minVal = root.val;
}
if (target < root.val) {
minVal = dfs(root.left, target, minVal);
} else {
minVal = dfs(root.right, target, minVal);
}
return minVal;
}
}
public static class Solution3 {
//a more concise solution
public int closestValue(TreeNode root, double target) {
if (root == null) {
return 0;
}
return dfs(root, target, root.val);
}
private int dfs(TreeNode root, double target, int minVal) {
if (root == null) {
return minVal;
}
if (Math.abs(root.val - target) < Math.abs(minVal - target)) {
minVal = root.val;
}
minVal = dfs(root.left, target, minVal);
minVal = dfs(root.right, target, minVal);
return minVal;
}
}
public static class Solution4 {
//BST iterative solution
public int closestValue(TreeNode root, double target) {
long minVal = Long.MAX_VALUE;
while (root != null) {
if (Math.abs(root.val - target) < Math.abs(minVal - target)) {
minVal = root.val;
}
if (target < root.val) {
root = root.left;
} else {
root = root.right;
}
}
return minVal == Long.MAX_VALUE ? 0 : (int) minVal;
}
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。