LeetCode-Search in Rotated Sorted Array

所难

于 2014-08-16 22:22:12 发布

阅读量482

点赞数

分类专栏： Cracking LeetCode Search 文章标签： leetcode Search in Rotated So

本文链接：https://blog.youkuaiyun.com/HolyDominat/article/details/38620681

版权

Cracking LeetCode 同时被 2 个专栏收录

152 篇文章

订阅专栏

7 篇文章

订阅专栏

本文介绍了一种在已知没有重复元素的旋转排序数组中搜索特定目标值的方法，并提供了一个C++实现示例。该算法使用了分治策略，通过递归调用改进了传统二分查找法以适应旋转数组的情况。

摘要生成于 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.

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
    int binarySearch(int A[], int begin, int end, const int &target) {
        if (begin > end) return -1;
        int mid = (begin+end)/2;
        if(A[mid] == target) return mid;
        else if (A[begin] <= A[mid]) {
            if (A[begin] <= target && target < A[mid]) return binarySearch(A, begin, mid-1, target);
            else return binarySearch(A, mid+1, end, target);
        } else if (A[mid] <= A[end]) {
            if (A[mid] < target && target <= A[end]) return binarySearch(A, mid+1, end, target);
            else return binarySearch(A, begin, mid-1, target);
        }
    }
    
    int search(int A[], int n, int target) {
        return binarySearch(A, 0, n-1, target);    
    }
};</span>