https://h30306.github.io/blog/zh-tw/tags/ordered-set/Recent content in Ordered-Set onHugo -- gohugo.iozh-twhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungSun, 26 Jul 2026 00:00:00 +0000https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2382/Sun, 26 Jul 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2382/LeetCode 2382 解題筆記：倒著做，把刪除變成加回去；Union-Find 的根記區段總和，最大值只會變大https://h30306.github.io/blog/zh-tw/leetcode/leetcode-220/Sat, 10 Jan 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-220/LeetCode 220 解題筆記：桶大小設成 valueDiff + 1，同一個桶裡的兩個數一定符合；只要再看相鄰兩個桶。視窗只保留最近 indexDiff 個數，所以每個桶最多一個數