Suppose an array of length n sorted in ascending order is rotated between 1 and 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 4 times[0,1,2,4,5,6,7] if it was rotated 7 times (back to original)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.
n == nums.length1 <= n <= 5000-5000 <= nums[i] <= 5000nums are uniquenums is sorted and rotated between 1 and n timesnums = [3,4,5,1,2]1nums = [4,5,6,7,0,1,2]0nums = [11,13,15,17]11