LeetCode:Find Minimum in Rotated Sorted Array

Problem:

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

Find the minimum element.

You may assume no duplicate exists in the array.

Subscribe to see which companies asked this question

class Solution {
public:
    int findMin(vector<int>& nums) {
        
        int first=0;
        int last=nums.size()-1;
        
        int result=INT_MAX;
        
        while(first<=last)
        {
            int mid=(first+last)/2;
            
            //没有旋转的情况 
            if(nums[first]<=nums[last])
                return min(nums[first],result);
                
            else
            {   
                //小于的情况
                if(nums[first]<=nums[mid])
                {  
                    first=mid+1;
                    
                }
                //大于的情况
                else
                {   
                    result=nums[mid];
                    last=mid-1;
                    
                }
                
            }
        }
        return result;
    }
};