2025年7月27日
[LeetCode] 2210. Count Hills and Valleys in an Array
摘要： You are given a 0-indexed integer array nums. An index i is part of a hill in nums if the closest non-equal neighbors of i are smaller than nums[i]. S 阅读全文
posted @ 2025-07-27 04:37 CNoodle 阅读(7) 评论(0) 推荐(0)