LeetCode: Hidden Problems that can be Solved by Binary Search -- 那些能用二分搜索解决的问题合集

4.Median of Two Sorted Arrays
29.Divide Two Integers
50.Pow(x, n)
69.Sqrt(x)
162. Find Peak Element
163. Dungeon Game
164. Minimum Size Subarray Sum
165. Count Complete Tree Nodes
166. Kth Smallest Element in a BST
167. H-Index II
278 first bad version
287 find the duplicate number
300 longest increasing subsequence
302 Smallest rectangle enclosing black pixels
315 count of smaller numbers after self
327 count of range sum
349 intersection of two arrays
350 intersection of two arrays 2
352 data stream as disjoint intervals
354 Russian doll envelops
363 Maximum sum of rectangle No larger than k
410. Split Array Largest Sum

有个很有意思的关于二分的思路的理解：任何数字都是可以由2的n次方组成的 比如说17 = 2^4 + 2 ^0