classSolution{public:intfindMin(vector<int>& nums){int n = nums.size();int l =0, r = n -1;while(l < r){int mid =(l+r)/2;if(nums[mid]> nums[r])
l = mid +1;else r = mid;}return nums[l];}};
代码(8.4 二刷自解)
classSolution{public:intfindMin(vector<int>& nums){int l =0, r = nums.size()-1;while(l < r){int mid =(l+r)/2;if(nums[mid]>= nums[0]){
l = mid +1;}else{
r = mid;}}return nums[l]> nums[0]? nums[0]:nums[l];}};