search

jingtianer / blog_comment

0 stars 0 forks source link

LeetCode-30 - Jingtianer #96

Open jingtianer opened 11 months ago

jingtianer commented 11 months ago

https://jingtianer.github.io/home/2023/12/19/LeetCode/LeetCode-%E5%88%B7%E9%A2%98%E6%80%BB%E7%BB%9330/

  1. 寻找峰值123456789class Solution &#123;public: int findPeakElement(vector<int>& nums) &#123; int index = 0; int n = nums.size(); while(index < n-1 && nums[