首页 / PYTHON / 81. Search in Rotated Sorted Array II Leetcode Python

81. Search in Rotated Sorted Array II Leetcode Python

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了81. Search in Rotated Sorted Array II Leetcode Python，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1018字，纯文字阅读大概需要2分钟。

内容图文

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



原文：http://blog.csdn.net/hyperbolechi/article/details/44584275

内容总结

以上是互联网集市为您收集整理的81. Search in Rotated Sorted Array II Leetcode Python全部内容，希望文章能够帮你解决81. Search in Rotated Sorted Array II Leetcode Python所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端

扫描二维码推送至手机访问。

本文链接：https://qyyshop.com/info/1194595.html

来源：【匿名】