Binary153FindMinimumInRotatedSortedArray

Method 1

O(n) method. Skip here.

Method 2

O(logn) method. Use binary search.

Failed Case {4,5,6,1,2,3} for bugtest method

Conditions are right, but didn’t think if should be

start = mid + 1;

or

start = mid

. 我们需要保证目标值时刻在start和end范围内, 因此要考虑如果用mid+1会不会破坏这个原则.

后来想了一个新方法, mid只用来移动start和end, 用start和end来做所有判断. 类似的方法有很多

https://discuss.leetcode.com/topic/73025/9-lines-java-binary-search

BinarySearch的精髓只是运用二分法, 至于conditions和moving rule都是灵活的!