James Pan

原题网址：https://leetcode.com/problems/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:

原题网址：https://leetcode.com/problems/bitwise-and-of-numbers-range/ Given a range [m, n] where 0 For example, given the range [5, 7], you should return 4. 思路：总体思路就是求出m和n的高位比特的公共前缀。 方法一：变动前缀本身。