Question:
Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?Would this affect the run-time complexity? How and why?
Suppose a sorted array 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
).
Find the minimum element.
The array may contain duplicates.
This is my first time to code a hard question!!! I just make a little adjustment form 153
public class Solution {
public int findMin(int[] nums) {
int len=nums.length;
if (nums == null || len == 0)
return 0;
else if(len==1)
return nums[0];
else
{
int low=0;
int high=len-1;
int mid;
while(low<high)
{
mid=(high-low)/2+low;
if (nums[mid] < nums[high] ||(nums[mid]==nums[high]&&nums[mid]!=nums[low]))
high = mid;
else if (nums[mid] > nums[high]||(nums[mid]==nums[low]&&nums[mid]!=nums[high]))
low = mid+1;
else if(nums[mid]==nums[high]&&nums[mid]==nums[low])
{
low++;
high--;
}
}
return nums[low];
}
}
}