LeetCode 153
Find Minimum in Rotated Sorted Array
- Problem Description:
将一串升序排列的数组元素循环左移若干次得到新的数组,题目要求在新的数组中找到最小的元素(即原升序排列的数组首部元素)。
具体的题目信息:
https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/ - Solution:
class Solution {
public:
int findMin(vector<int>& nums) {
if (nums.size() == 0) return 0;
if (nums.size() == 1) return nums[0];
int low = 0, high = nums.size()-1;
while(low<high) {
int mid = low+(high-low)/2;
if (nums[mid]<=nums[high]) {
high = mid;
} else {
low = mid+1;
}
}
return nums[low];
}
};