[LeetCode] Search in Rotated Sorted Array II

最新推荐文章于 2020-08-30 11:00:31 发布

原创最新推荐文章于 2020-08-30 11:00:31 发布 · 556 阅读

0 ·

CC 4.0 BY-SA版权

Algorithm 同时被 2 个专栏收录

86 篇文章

订阅专栏

LeetCode

76 篇文章

订阅专栏

本文介绍了一个针对含有重复元素的旋转有序数组进行搜索的问题，并提供了一种解决方案。通过自定义函数search，采用二分查找法来确定目标值是否存在于数组中，同时考虑了数组旋转和重复元素带来的复杂性。

Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

Write a function to determine if a given target is in the array.

class Solution {
public:
    bool 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 true;
            if(A[left] < A[mid])
            {
                if(A[left] <= target && target < A[mid])
                    right = mid - 1;
                else
                    left = mid + 1;
            }
            else if(A[left] > A[mid])
            {
                if(A[mid] < target && target <= A[right])
                    left = mid + 1;
                else
                    right = mid - 1;
            }
            else
                left++;
        }
        return false;
    }
};