Day24力扣打卡

打卡记录

寻找峰值（二分法）

class Solution {
public:int findPeakElement(vector<int> &nums) {int left = -1, right = nums.size() - 1; // 开区间 (-1, n-1)while (left + 1 < right) { // 开区间不为空int mid = left + (right - left) / 2;if (nums[mid] > nums[mid + 1]) right = mid; // 蓝色else left = mid; // 红色}return right;}
};