【第一部分】07Leetcode刷题

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

题目：153. Find Minimum in Rotated Sorted Array

C++ Soution 1:

class Solution {
public:
    int findMin(vector<int> &num) 
    {
        int left = 0, right = num.size() - 1;
        if (num[left] > num[right]) 
        {
            while (left != (right - 1)) 
            {
                int mid = (left + right) / 2;
                if (num[left] < num[mid]) left = mid;
                else right = mid;
            }
            return min(num[left], num[right]);
        }
        return num[0];
    }
};