160.Find Minimum in Rotated Sorted Array II

1.Description(Medium)

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.

Notice

The array may contain duplicates.

Example

Given[4,4,5,6,7,0,1,2]return0.

2.Code

Last updated