154. find minimum in rotated sorted array ii

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

class  {
    public int findMin(int[] array) {
        if (array == null || array.length == 0) {
            return -1;
      }
        int min = array[0];
     for (int i = 1; i < array.length; i++) {
            if (array[i] < min) {
                min = array[i];
            }
        }
        return min;
        
    }
}

154. find minimum in rotated sorted array ii

近期文章

近期评论

标签

热门

文章归档

分类目录

功能