leetcode-1438 - Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
動機 sliding window但是用heap去找window的最大最小 ...
動機 sliding window但是用heap去找window的最大最小 ...
動機 What makes this problem hard is that we have negative values. sliding window + monotone stack = monotone queue prefix sum in fly + hash ...
動機 很經典,但沒想過可以用兩個stack ...
動機 讓每個遞迴只負責一個工作 ...
動機 複習Counter ...
動機 從sliding window到寫merge interval的變化版 ...