LintCode-159. 寻找旋转排序数组中的最小值

public class Solution {
    /**
     * @param nums: a rotated sorted array
     * @return: the minimum number in the array
     */
    public int findMin(int[] nums) {
        // write your code here
        int length = nums.length - 1;
        if (length == 0) return nums[0];
        boolean flag = nums[0] < nums[length];
        for (int i = 0; i <= length; i++) {
            if (flag) {
                if (nums[i] < nums[i + 1]) return nums[i];
            } else {
                if(nums[length - i] < nums[length - i - 1]) return nums[length - i];
            }
        }
        return nums[0];
    }
}