水中的鱼: [LeetCode] Search in Rotated Sorted Array 解题报告

水中的鱼: [LeetCode] Search in Rotated Sorted Array 解题报告

[LeetCode] Search in Rotated Sorted Array 解题报告

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.

» Solve this problem


[解题思想]
同样是二分，难度主要在于左右边界的确定。需要结合两个不等式：
1. A[m] ? A[left]
2. A[m] ? target
具体逻辑看code。

Read full article from 水中的鱼: [LeetCode] Search in Rotated Sorted Array 解题报告