image.png
class Solution {
public:
int findMin(vector<int>& nums) {
int start = 0;
int end = nums.size() - 1;
while(start + 1 < end){
int mid = start + (end - start) / 2;
if(nums[mid] < nums[end]) end = mid;
else start = mid + 1;
}
return min(nums[start], nums[end]);
}
};
LeetCode 153. Find Minimum in Rotated Sorted Array Descri...
Find Minimum in Rotated Sorted Array Suppose an array sor...
Find Minimum in Rotated Sorted Array Suppose an array sor...
这一题来自剑指offer，做了至少有三遍，也看了很多遍，但还是没记住？我是猪。。这一题需要考虑一个额外的情况，其实...
Suppose an array sorted in ascending order is rotated at ...
先问了Hash, what happen if there is a collision?
Suppose a sorted array is rotated at some pivot unknown t...
Swift 3.0
Suppose an array sorted in ascending order is rotated at ...
本文标题：153. Find Minimum in Rotated Sor
本文链接：https://www.haomeiwen.com/subject/zivuiftx.html
网友评论