Leetcode 153. Find Minimum in Rotated Sorted Array | | Leetcode 153. Find Minimum in Rotated Sorted Array 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution1234567891011121314151617181920class Solution {public: int findMin(vector<int>& nums) { int left = 0; int right = nums.size() - 1; while(left < right) { if(nums[left] < nums[right]) { return nums[left]; } int mid = (left + right) / 2; if(nums[mid] >= nums[left]) { left = mid + 1; } else { right = mid; } } return nums[left]; }}; Reference https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏