LeetCode OJ:Search in Rotated Sorted Array

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.

算法思想：

因为不考虑有重复点，一般的二叉搜索树数组与该旋转树数组的区别在于，二叉搜索树数组中间节点将整个数组分成两部分，这两部分依然保持单调递增的顺序，旋转树数组就不是的了，但是左右必有一部分是按照单调递增顺序的（和搜索树一样）其实也可以和II一样处理Search in Rotated Sorted Array II

class Solution {
public:
    int search(int A[], int n, int target) {
        int left=0,right=n-1;
        while(left<=right){
            int mid=(left+right)/2;
            if(A[mid]==target)return mid;
            if(A[left]<=A[mid]){
                if(A[left]<=target&&target<A[mid])right=mid-1;
                else left=mid+1;
            }
            else {
                if(A[mid]<target&&target<=A[right])left=mid+1;
                else right=mid-1;
            }
        }
        return -1;
    }
};