LintCode-159.寻找旋转排序数组中的最小值

寻找旋转排序数组中的最小值

code

class Solution {
public:
/**
* @param nums: a rotated sorted array
* @return: the minimum number in the array
*/
int findMin(vector<int> &nums) {
// write your code here
int size = nums.size();
if(size == 0)
return 0;

int min = nums[0];
for(int i=1; i<size; i++) {
if(min > nums[i])
min = nums[i];
}
return min;
}
};