# Search in Rotated Sorted Array II

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.

public class Solution {
/*it is a good question following the rotated sorted array 1*/
/*eg 3  1 2 3 3 3, we don;t know where to go,left or right. so we just start ++ until they are different.*/
//if all the elmement is same, and the target is not in the array.the time complexity is O(n)
public boolean search(int[] nums, int target) {
if(nums == null || nums.length == 0)
return false;
int low = 0;
int high = nums.length - 1;
while(low <= high) {
int mid = (low + high) / 2;
if(nums[mid] == target)
return true;
if(nums[mid] > nums[low]) {
if(target >= nums[low] && target < nums[mid])
high = mid -1;
else
low = mid + 1;
}
else if(nums[mid] < nums[low]) {
if(target > nums[mid] && target <= nums[high])
low = mid + 1;
else
high = mid -1;
}
//here is most important to solve the duplicate
else  {
low ++;
}
}

return false;
}
}
• 本文已收录于以下专栏：

## [LeetCode]Search in Rotated Sorted Array II

Question Follow up for “Search in Rotated Sorted Array”: What if duplicates are allowed?Would this...
• byamao1
• 2016年11月05日 16:50
• 56

## LeetCode之Search in Rotated Sorted Array II

/*本题与的Search in Rotated Sorted Array差别在于可能有重复的 元素，但还是可以采用与Search in Rotated Sorted Array类似的方法。 但是在判断...

## leetcode -- Search in Rotated Sorted Array I &II 重点可以考

https://leetcode.com/problems/search-in-rotated-sorted-array/ https://leetcode.com/problems/search-...
• xyqzki
• 2015年12月15日 22:24
• 272

## LeetCode81——Search in Rotated Sorted Array II

LeetCode81——Search in Rotated Sorted Array II

举报原因： 您举报文章：Search in Rotated Sorted Array II 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)