题解 | #旋转数组的最小数字#

class Solution {
  public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param nums int整型vector
     * @return int整型
     */
    int minNumberInRotateArray(vector<int>& nums) {
        // write code here
        
        int low = 0 ; int high = nums.size() - 1;   
        while(low < high){
            int mid = low + (high - low) / 2;        
            if(nums[mid] > nums[high]){
                low = mid + 1;
            }else if(nums[mid] == nums[high]){
                high = high - 1;
            }else{
                high = mid;
            }   
        }
        return nums[low];
    }
};

easy