2025年1月18日
[LeetCode] 2909. Minimum Sum of Mountain Triplets II
摘要： You are given a 0-indexed array nums of integers. A triplet of indices (i, j, k) is a mountain if: i < j < k nums[i] < nums[j] and nums[k] < nums[j] R 阅读全文
posted @ 2025-01-18 01:36 CNoodle 阅读(57) 评论(0) 推荐(0)