解题思路:
- 思路一:暴力搜索
- 思路二:二分搜索,当 mid > right时, left = mid+1;当mid < left时,right = mid;否则,right–;
//思路一
class Solution {
public:
int findMin(vector<int>& nums)
{
for(int i = 1; i < nums.size(); ++i)
{
if(nums[i] < nums[i - 1])
return nums[i];
}
return nums[0];
}
};
//思路二
class Solution {
public:
int findMin(vector<int>& nums)
{
int left = 0;
int right = nums.size() - 1;
while(left < right)
{
int mid = (left + right) / 2;
if(nums[mid] > nums[right])
left = mid + 1;
else if(nums[mid] < nums[left])
right = mid;
else
right--;
}
return nums[left];
}
};