| English | 简体中文 |
Suppose an array of length
n sorted in ascending order is rotated between
n times. For example, the array
nums = [0,1,2,4,5,6,7] might become:
[4,5,6,7,0,1,2]if it was rotated
[0,1,2,4,5,6,7]if it was rotated
Notice that rotating an array
[a, a, a, ..., a[n-1]] 1 time results in the array
[a[n-1], a, a, a, ..., a[n-2]].
Given the sorted rotated array
nums, return the minimum element of this array.
Input: nums = [3,4,5,1,2] Output: 1 Explanation: The original array was [1,2,3,4,5] rotated 3 times.
Input: nums = [4,5,6,7,0,1,2] Output: 0 Explanation: The original array was [0,1,2,4,5,6,7] and it