Leetcode153. 寻找旋转排序数组中的最小值 -hot100

题目：

---

代码(首刷自解 2024年3月8日)：

class Solution {
public:
    int findMin(vector<int>& nums) {
        int mid, left = 0, right = nums.size() - 1;
        int rightestVal = nums[right];
        while (left <= right) {
            mid = left + (right - left) / 2;
            if (nums[mid] < rightestVal) {
                right = mid - 1;
            } else if (nums[mid] > rightestVal) {
                left = mid + 1;
            } else {
                return nums[mid];
            }
        }
        return nums[left];
    }
};