LeetCode-Solutions/FindMinimumSortedRotatedArray.java at master · dhirajpodar/LeetCode-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
public int findMin(int[] nums) {

        if(nums.length == 0) return -1;
        if(nums.length == 1) return nums[0];

        int low = 0;
        int high = nums.length-1;

        while(low<high){
            int mid = low+(high-low)/2;

            if(mid>0 && nums[mid] < nums[mid-1]){
                return nums[mid];
            }else if(nums[mid] >= nums[low] && nums[mid] > nums[high]){
                low = mid +1;
            }else{
                high = mid -1;
            }
        }
        return nums[low];
    }