Search in Rotated Sorted Array

真水壶

于 2014-03-04 16:50:22 发布

阅读量378

点赞数

分类专栏： leetcode 文章标签：数组

本文链接：https://blog.csdn.net/enjoyuseless/article/details/20471225

版权

leetcode 专栏收录该内容

154 篇文章 0 订阅

订阅专栏

class Solution {
public:
    int search(int A[], int n, int target) {
        int left=0,right=n-1;
        while(left<=right)
        {
            int mid=left+(right-left)/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;
    }
};