/
githubmirror
/
interviews
Обзор
Документация
Войти
/
githubmirror
/
interviews
Код
Запросы
0
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
leetcode/binary-search/ClosestBinarySearchTreeValue.java
29 строк
876 B
Kevin Naughton Jr
finish renaming files and directories
27 мар 2018, 19:52
27 мар 2018, 19:52
ec6dfb5
Код
Авторство
О чём код?
// Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target. // Note: // Given target value is a floating point. // You are guaranteed to have only one unique value in the BST that is closest to the target. /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class ClosestBinarySearchTreeValue { public int closestValue(TreeNode root, double target) { int value = root.val; TreeNode child = root.val < target ? root.right : root.left; if(child == null) { return value; } int childValue = closestValue(child, target); return Math.abs(value - target) < Math.abs(childValue - target) ? value : childValue; } }