2026/04/26

[LeetCode]153 Find Minimum in Rotated Sorted Array

知道可以二分

但細節還是沒搞懂

實際會收斂在哪?

每個值是否unique會有甚麼影響?

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
class Solution {
public:
  int findMin(vector<int>& nums) {
    int low = 0;
    int high = nums.size() - 1;
    while(low < high) {
      int mid = (low + high) / 2;
      if (nums[mid] > nums[high])
        low = mid + 1;
      else
        high = mid;
    }
    return nums[low]; 
  }
};