[LeetCode] 81. Search in Rotated Sorted Array II_Medium tag: not real binary search anymore

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]).

You are given a target value to search. If found in the array return true, otherwise return false.

Example 1:

Input: nums = [2,5,6,0,0,1,2], target = 0
Output: true

Example 2:

Input: nums = [2,5,6,0,0,1,2], target = 3
Output: false

Follow up:

• This is a follow up problem to Search in Rotated Sorted Array, where numsmay contain duplicates.
• Would this affect the run-time complexity? How and why?

这个题目跟[LeetCode] 154. Find Minimum in Rotated Sorted Array II_Hard tag: not real binary search anymore类似，因为可以有重复，如果重复数目太多的话，时间复杂度会上升到O（n），所以就直接用O(n) 的方法就好。

Code

class Solution:
    def searchRotate2(self, nums, target):
        return True if target in nums else False

 

转载于:https://www.cnblogs.com/Johnsonxiong/p/11174770.html