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.
Solution
(Search-in-Rotated-Sorted-Array2.py) download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
| class Solution(object):
def search(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: bool
"""
l = 0
r = len(nums)-1
if len(nums) == 0:
return False
while l <= r:
# skip duplicates
while l < r and nums[l] == nums[l+1]:
l += 1
while l < r and nums[r] == nums[r-1]:
r -= 1
m = (l+r)/2
if nums[m] == target:
return True
if nums[m] >= nums[l]:
if nums[l] <= target and target < nums[m]:
r = m-1
else:
l = m+1
else:
if target > nums[m] and target <= nums[r]:
l = m+1
else:
r = m-1
return False
|