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 of unique elements, return the minimum element of this array.
You must write an algorithm that runs in
O(log n) time.
Input: nums = [3,4,5,1,2]
Explanation: The original array was [1,2,3,4,5] rotated 3 times.
Input: nums = [4,5,6,7,0,1,2]
Explanation: The original array was [0,1,2,4,5,6,7] and it was rotated 4 times.
Input: nums = [11,13,15,17]
Explanation: The original array was [11,13,15,17] and it was rotated 4 times.
n == nums.length
1 <= n <= 5000
-5000 <= nums[i] <= 5000
- All the integers of
numsis sorted and rotated between
Time complexity: O(log^N)
Space complexity: O(1)