[LeetCode]Search in Rotated Sorted Array

CiaoLiang

于 2015-05-09 13:35:36 发布

阅读量294

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/CiaoLiang/article/details/45600781

LeetCode 专栏收录该内容

149 篇文章

订阅专栏

本文介绍如何在已排序并部分旋转的数组中搜索特定目标值，通过修改二分查找算法来解决此问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

LeetCode Source

思路：Binary Search ，但是此题的规则要稍作修改，要判断左半边是否有序。

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