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.
You may assume no duplicate exists in the array.
就是一个二分法,不过开始的时候为什么没想到二分。。。明明这么简单。。。
class Solution {
public:
int findMin(vector<int> &num) {
int size = num.size() - 1;
int l = 0;
int r = size;
while(l <= r) {
int mid = (l + r) / 2;
if(num[mid] > num[size]) {
l = mid + 1;
} else {
r = mid - 1;
}
}
return num[l];
}
};