2024年3月30日
[LeetCode] 2962. Count Subarrays Where Max Element Appears at Least K Times
摘要： You are given an integer array nums and a positive integer k. Return the number of subarrays where the maximum element of nums appears at least k time 阅读全文
posted @ 2024-03-30 06:26 CNoodle 阅读(19) 评论(0) 推荐(0) 编辑