Find Min in Rotated Array II

Find Min in Rotated Array II

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.

The array may contain duplicates.

Example

Given [4,4,5,6,7,0,1,2] return 0

Solution:

    public int findMin(int[] num) {
        if (num == null || num.length == 0) {
            return 0;
        }
        int min = num[0];
        for (int i : num) {
            if (i < min) {
                min = i;
                break;
            }
        }
        return min;
    }

思路：

有重复可变成无序 {3,3,0,3,3,3,3}

只能遍历