LeetCode 154. Find Minimum in Rotated Sorted Array II

154. Find Minimum in Rotated Sorted Array II

Difficulty:: Hard

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.

The array may contain duplicates.

Example 1:

1 2	Input: [1,3,5] Output: 1

Example 2:

1 2	Input: [2,2,2,0,1] Output: 0

Note:

This is a follow up problem to .
Would allow duplicates affect the run-time complexity? How and why?

Solution

Language: Java

class Solution {
    public int findMin(int[] nums) {
        if (nums == null) {
            return -1;
        }
        int min = Integer.MAX_VALUE;
        for (int i : nums) {
            if (i < min) {
                min = i;
            }
        }
        return min;
    }
}