153. Find Minimum in Rotated Sorted Array

Runtime    0 ms
Beats      100%


Memory     40.8 MB
Beats      70.11%


class Solution {
    public int findMin(int[] nums) {
        int l=0,h=nums.length-1,mid=0;
        int ans=5000;
        while(l<=h){
            mid=(l+h)/2;
            if(nums[l]<=nums[h]){
                ans=Math.min(ans,nums[l]);
                break;
            }
            if(nums[l]<=nums[mid]){
                ans=Math.min(ans,nums[l]);
                l=mid+1;
            }
            else{
                ans=Math.min(ans,nums[mid]);
                h=mid-1;
            }
        }
        return ans;
    }
}