Leetcode87: Find Minimum in Rotated Sorted Array

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 n = nums.size()-1;        int l = 0;        int r = n;        while(l<=r)        {            int mid = l + (r-l)/2;            if(nums[mid] > nums[n])            {                l = mid+1;            }            else            {                r = mid-1;            }        }        return nums[l];    }};