Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 153. Find Minimum in Rotated Sorted Array

---

題目：


解答：

class Solution {
public:
    int findMin(vector<int>& nums) {
        int l = 0;
        int r = nums.size() - 1;

        while (l < r) {
            int m = l + ((r - l) >> 1);

            if (nums[m] > nums[r]) {
                l = m + 1;
            }
            else {
                r = m;
            }
        }

        return nums[l];
    }
};