Leetcode 153. Find Minimum in Rotated Sorted Array (Medium) (cpp)

Leetcode 153. Find Minimum in Rotated Sorted Array (Medium) (cpp)

Tag: Array, Binary Search

Difficulty: Medium

/*

153. Find Minimum in Rotated Sorted Array (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.

You may assume no duplicate exists in the array.

*/
class Solution {
public:
int findMin(vector<int>& nums) {
int left = 0, right = nums.size() - 1;
while (left < right) {
int mid = (left + right) / 2;
if (nums[mid] < nums[right]) right = mid;
else left = mid + 1;
}
return nums[left];
}
};