81. Search in Rotated Sorted Array II Leetcode Python

最新推荐文章于 2021-12-03 15:03:25 发布

hyperbolechi

最新推荐文章于 2021-12-03 15:03:25 发布

阅读量602

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： python leetcode search

本文链接：https://blog.youkuaiyun.com/hyperbolechi/article/details/44584275

leetcode 专栏收录该内容

166 篇文章

订阅专栏

本文探讨了含有重复元素的旋转有序数组搜索问题，并提供了两种解决思路：一是基于寻找枢轴并划分数组的方法；二是改进后的二分查找算法。通过具体实现展示了如何判断目标值是否存在。

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

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.

generally we can have two methods to do this problem, the first one is based on finding pivot and then divide the array into two parts, then search.

second one is still based on Binary search.

class Solution:
    # @param A a list of integers
    # @param target an integer
    # @return a boolean
    def search(self, A, target):
        if len(A) == 0:
            return False
        low = 0
        high = len(A) - 1
        while low < high:
            mid = low + (high - low) / 2
            if A[mid] == target:
                return True
            if A[low] < A[mid]:
                if A[low] <= target < A[mid]:
                    high = mid - 1
                else:
                    low = mid + 1
            elif A[low] > A[mid]:
                if A[mid]< target <= A[high]:
                    low = mid +1
                else:
                    high = mid -1
            else:
                low += 1
        if A[low] == target:
            return True
        return False