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.
class Solution {
public:
int search(int A[], int n, int target) {
int left = 0;
int right = n-1;
while(left <= right)//left,right均为 mid +/- 1,存在交错,满足退出条件
{
......
阅读全文