[leetcode]Find Minimum in Rotated Sorted Array
Posted on 2014-10-16 10:51 1957 阅读(2394) 评论(1) 编辑 收藏 举报很眼熟。。。就是一个二分。。。
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 - l) / 2; if (num[mid] > num[size]) { //left l = mid + 1; } else { r = mid - 1; } } return num[l]; } };
by 1957