Leetcode中的Find Minimum in Rotated Sorted Array II
如果数组可以包含重复的元素,问题变成:
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/
原题
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.
翻译:和I相比唯一的变化就是数组允许有相同的元素,解决这个问题,并且,时间复杂度有变化吗。
问题分析
其实有了search问题的启发,这个问题也就不难了,而且时间复杂度也是可能趋向于O(n)。
我们还是先贴上上一题的代码,以供对比。
public int findMin(int[] nums)
{
int low = 0, high = nums.length - 1;
while(high - low > 1)
{
int mid = (high + low)/2;
if(nums[mid] >= nums[low])
{
if(nums[high] < nums[low])
{
low = mid + 1;
}
else
{
high = mid - 1;
}
}
else
{
high = mid;
}
}
return Math.min(nums[low],nums[high]);
}
还是对于mid==low的情况,这里举一个小例子,假设rotate以后的数组是[2,2,2,2,2,1,2,2,2,2],我们还是需要O(n)才能找到1这个最小的元素。闲言少叙,上代码。
public int findMin(int[] nums)
{
int low = 0, high = nums.length - 1;
while(high - low > 1)
{
int mid = (high + low)/2;
if(nums[mid] > nums[low])
{
if(nums[high] <= nums[low])
{
low = mid + 1;
}
else
{
high = mid - 1;
}
}
else if(nums[mid] < nums[low])
{
high = mid;
}
else
{
++low;
}
}
return Math.min(nums[low],nums[high]);
}
接下来我们来研究研究题目中包含“integer”的几个问题,嘿嘿