# leetcode: 81. Search in Rotated Sorted Array II

## Problem

```# Follow up for "Search in Rotated Sorted Array":
#     What if duplicates are allowed?
#
# Would this affect the run-time complexity? How and why?
# Suppose an array sorted in ascending order is rotated
# at some pivot unknown to you beforehand.
#
# (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
#
# Write a function to determine if a given target is in the array.
#
# The array may contain duplicates.```

## Idea

```相比 [leetcode: 33. Search in Rotated Sorted Array] ，区别在于：

leetcode: 33. Search in Rotated Sorted Array

## AC

```class Solution():
def search(self, x, target):
left, right = 0, len(x) - 1
while left <= right:
mid = (left + right) // 2
if x[mid] == target:
return True
elif x[mid] == x[left]:    # x[mid] = x[left] 时，很难判断 target 会落在哪，那么只能采取 left+=1
left += 1
elif x[left] <= target < x[mid] or (x[left] > x[mid] and not x[mid] < target <= x[right]):
right = mid - 1
else:
left = mid + 1
return False

if __name__ == "__main__":
assert Solution().search([3, 5, 1], 3) == True
assert Solution().search([2, 2, 3, 3, 4, 1], 1) == True
assert Solution().search([4, 4, 5, 6, 7, 0, 1, 2], 5) == True```

0 条评论

## 相关文章

### FZU 2098 刻苦的小芳（卡特兰数，动态规划）

Problem 2098 刻苦的小芳 Accept: 42 Submit: 70 Time Limit: 1000 mSec Memory ...

32860

12030

21140

### 聊聊rocketmq的PullConsumerImpl

io/openmessaging/rocketmq/consumer/PullConsumerImpl.java

26410

### 聊聊storm的maxSpoutPending

storm-2.0.0/storm-client/src/jvm/org/apache/storm/Config.java

26450

12610

22410

34090

9610

### 聊聊storm的ICommitterTridentSpout

storm-core-1.2.2-sources.jar!/org/apache/storm/trident/spout/ICommitterTridentSp...

9820