Find Minimum in Rotated Sorted Array

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.

 

public class Solution {
    public int findMin(int[] nums) {
        if (nums == null || nums.length == 0) {
        	return 0;
        }
        int low = 0;
        int high = nums.length - 1;
        int mid = 0;
        while (low < high) {
        	if (low == high - 1) {
        		break;
        	}
        	if (nums[low] < nums[high]) {
        		return nums[low];
        	}
        	mid = (low + high) / 2;
        	if (nums[low] > nums[mid]) {
        		high = mid;
        		continue;
        	}
        	if (nums[mid] > nums[high]) {
        		low = mid;
        		continue;
        	}
        	while (low < mid) {
        		if (nums[low] == nums[mid]) {
        			low++;
        		} else if (nums[low] < nums[mid]) {
        			return nums[low];
        		} else {
        			high = mid;
        			break;
        		}
        	}
        }
        return Math.min(nums[low], nums[high]);
    }
}