leetcode--Find Minimum in Rotated Sorted Array II ---C++
2015-09-08 17:32
417 查看
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 7might become
4 5 6 7 0 1 2).
Find the minimum element.
The array may contain duplicates.
：思路，还是二分查找。不过当有重复数据时，且：nums[start] == nums[mid] && nums[mid] == nums[end]时，只能顺序遍历。
class Solution {
public:
int findMin(vector<int>& nums) {
int start = 0;
int end = nums.size() - 1;
int mid = start;
while(nums[start] >= nums[end])
{
if(end - start == 1)
{
mid = end;
break;
}
mid = (start + end) / 2;
if(nums[start] == nums[mid] && nums[mid] == nums[end])
return min(nums,start,end);
if(nums[start] <= nums[mid])
start = mid;
else
end = mid;
}
return nums[mid];
}
private:
int min(vector<int>& num,int low,int high)
{
int mintmp = num[low];
while(low <= high)
{
if(num[low] < mintmp)
mintmp = num[low];
++low;
}
return mintmp;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 