2016年3月6日
[LeetCode] 272. Closest Binary Search Tree Value II 最近的二分搜索树的值之二
摘要： Given a non-empty binary search tree and a target value, find k values in the BST that are closest to the target. Note: Given target value is a floati 阅读全文
posted @ 2016-03-06 14:32 Grandyang 阅读(18625) 评论(3) 推荐(1)
Fork me on GitHub