153. Find Minimum in Rotated Sorted Array

原文鏈接：https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/discuss/48493/Compact-and-clean-C%2B%2B-solution

class Solution {
    public int findMin(int[] nums) {
       
        int start=0,end=nums.length-1;
        
        
      
        
        while(start<end)
        {
       
            if(nums[start]<nums[end])
        {
            return nums[start];
        }
            int mid=(start+end)/2;
            if(nums[start]<=nums[mid])
            {
                start=mid+1;
            }
            else
            {
                end=mid;
            }
            
        }
        return nums[start];
    }
}