270: Closest Binary Search Tree Value
来源：互联网 发布：编程常用的算法 编辑：程序博客网 时间：2024/06/01 03:57
Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target.
Solution 1
public class Solution { public int closestValue(TreeNode root, double target) { int closest = root.val; double min = Double.MAX_VALUE; while(root!=null) { if( Math.abs(root.val - target) < min ) { min = Math.abs(root.val - target); closest = root.val; } if(target < root.val) { root = root.left; } else if(target > root.val) { root = root.right; } else { return root.val; } } return closest; }} 0 0
- leetcode 270: Closest Binary Search Tree Value
- [leetcode 270] Closest Binary Search Tree Value
- Leetcode 270Closest Binary Search Tree Value
- 270: Closest Binary Search Tree Value
- LeetCode 270: Closest Binary Search Tree Value
- Leetcode 270 Closest Binary Search Tree Value
- Closest Binary Search Tree Value
- Closest Binary Search Tree Value
- Leetcode NO.270 Closest Binary Search Tree Value
- Easy 270题 Closest Binary Search Tree Value
- Closest Value in Binary Search Tree
- [Leetcode]Closest Binary Search Tree Value II
- [Leetcode]Closest Binary Search Tree Value
- *LeetCode-Closest Binary Search Tree Value
- [LeetCode270]Closest Binary Search Tree Value
- [LeetCode282]Closest Binary Search Tree Value II
- Closest Binary Search Tree Value II
- Closest Binary Search Tree Value II
- BZOJ 1111 POI2007 四进制的天平
- cocos2d-x之自定义控件ScrollBar的设计
- leetcode328题 题解 翻译 C语言版 Python版
- ListView 与Adapter之间的关系
- 100. Same Tree LeetCode
- 270: Closest Binary Search Tree Value
- Android目录结构 及作用——摘自第一行代码
- 242. Valid Anagram LeetCode
- ng-class中的if else判断
- 图片缓存
- DevExpress 从一个XtraGridControl 拖拽行到另外一个
- windows中安装python
- 171. Excel Sheet Column Number LeetCode
- class 和id的区别和联系
