1. 153

find-minimum-in-rotated-sorted-array

2. 算法

• O(lgn)

3.代码

class Solution {

public:

    int findMin(vector<int>& nums) {

        int left=0,right=nums.size()-1;

        int mid;

        while(left<=right){

            mid=left+(right-left)/2;

            if(nums[left]<=nums[mid] && nums[mid]<=nums[right]){

                return nums[left];

            }else if(nums[left]<=nums[mid]){

                left=mid+1;

            }else{

                right=mid;

            }

        }

        return nums[0];

    }

};