81. Search in Rotated Sorted Array II

题目描述：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.
我的思路：
        跟前面那题类似，不过是数组中可以包含重复的元素。
我的代码：class Solution:
def search(self, nums, target):                # 不讲道理的Python一行搞定，什么重复不重复的。
return True if target in nums else FalseDiscuss：class Solution:
def search(self, nums, target):
if not nums:
return False
l, r = 0, len(nums) - 1
while l <= r:
mid = l + int((r-l)/2)
if nums[mid] == target:
return True
while l < mid and nums[l] == nums[mid]:
l += 1

if nums[l] <= nums[mid]:
if nums[l] <= target < nums[mid]:
r = mid - 1
else:
l = mid + 1
else:
if nums[mid] < target <= nums[r]:
l = mid + 1
else:
r = mid - 1
return False学到：