LeetCode153.寻找旋转排序数组中的最小值

题目来源：

https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/

题目描述：

代码如下：

class Solution {
	public int findMin(int[] nums) {
        if(nums == null || nums.length == 0)
            return -1;
		int left = 0, right = nums.length - 1, mid = 0;
		while (left < right) {
			mid = (left + right) >> 1;
			if (nums[mid] > nums[right])
				left = mid + 1;
			else
				right = mid;
		}
		return nums[left];
	}
}