search

nagato1208 / nagato1208.github.io

For my blog
2 stars 0 forks source link

leetcode-[单调队列]-[239,1425] | Nagato at sea #60

Open nagato1208 opened 4 years ago

nagato1208 commented 4 years ago

https://nagato1208.github.io/2020/04/26/leetcode-%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97-239-1425/#more

  1. Sliding Window Maximum思路类似这种在某个valid value set里面取最值的题目其实很多, 比如218 city skyline问题的heap解法, 也是把当前有效(可用)的高度维护在堆中,每次取最值. 同理, 本题我们用双端队列来维护当前所有的valid值. 每次检查队列内最早的元素坐标, 是否和当前坐标的距离大于k, 如果大于, (根据题意)需要扔掉(q
nagato1208 commented 3 years ago

硬币问题(无限，01背包) 322, 518, 416, 494, 1774,