标签：pivot minimum rotated sorted leetcode
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.
方法一：直接遍历求解
class Solution {
public:
int findMin(vector<int>& nums) {
int n = nums.size();
int min = nums[0];
for(int i = 1; i < n; i++) {
if(nums[i]<min){
min = nums[i];
}
}
return min;
}
};方法二：二分法（待解）
Leetcode[154]-Find Minimum in Rotated Sorted Array II
标签：pivot minimum rotated sorted leetcode
原文地址：http://blog.csdn.net/dream_angel_z/article/details/46454979
