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

 1 class Solution {
 2 public:
 3     /**
 4      * @param nums: a rotated sorted array
 5      * @return: the minimum number in the array
 6      */
 7     int findMin(vector<int> &nums) {
 8         // write your code here
 9         int size = nums.size();
10         if(size == 0)
11             return 0;
12 
13         int min = nums[0];
14         for(int i=1; i<size; i++) {
15             if(min > nums[i])
16                 min = nums[i];
17         }
18         return min;
19     }
20 };