Find Minimum in Rotated Sorted Array

题目地址：https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/

Suppose an array sorted in ascending order 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 FindMinimumInRotatedSortedArray {
    public static int findMin(int[] nums) {
        if (nums.length == 1)
            return nums[0];

        for (int i = 0; i < nums.length - 1; i++) {
            if (nums[i] < nums[i + 1])
                continue;
            if (nums[i] > nums[i + 1])
                return nums[i + 1];
        }

        return nums[0];
    }

    public static void main(String[] args) {
        int[] nums = {4, 5, 6, 7, 0, 1, 2, 3};
        System.out.println(findMin(nums));
    }
}

平均时间复杂度为O(n)。