BinarySearch

[YuezhenQin]

• 递归实现
• 非递归实现 int left = 0, right = arr.length - 1; while(left <= right) {...} return -1;

[YuezhenQin]

BinarySearch On Arrays (Search Spaces)

Solution704. Solution74.

BinarySearch On Solution Spaces

When a problem wants you to find the min/max, it wants you to find the threshold where the task transitions from impossible to possible.

First, we establish the possible solution space by identifying the minimum possible answer as left and the maximum possible answer right.

Next, we binary search on this solution space. For each mid, we perform a check() to see if the task is possible. Depending on the result, we halve the search space. Eventually, we will find the threshold.

Solution875.