154. Find Minimum in Rotated Sorted Array II

//8ms ac
class Solution {
public:
int findMin(vector<int>& nums) {
if(nums[0]<nums[nums.size()-1]) return nums[0];
int l=0,r=nums.size()-1;
while(l<r)
{
int m=l+(r-l)/2;
if(nums[l]>nums[l+1]) return nums[l+1];
if(nums[m]>nums[m+1]) return nums[m+1];
if(nums[m]<nums[l]) r=m;
else if(nums[m]>nums[l])l=m;
else l++;
}
return nums[0];
}
};