文章分类 -  单调队列

LeetCode 862
摘要：非典型单调队列 class Solution { public int shortestSubarray(int[] nums, int k) { int n = nums.length; long[] s = new long[n + 1]; for (int i = 1; i <= n; i++ 阅读全文
posted @ 2022-04-08 20:04 CrazyShanShan 阅读(13) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示