↓快轉到主要內容

LeetCode

LeetCode 503: Next Greater Element II（單調棧）
·1 分鐘
LeetCode Daily Medium Array Stack Monotonic-Stack Circular-Array
單調棧、環狀陣列
LeetCode 496: Next Greater Element I
·1 分鐘
LeetCode Daily Easy Array Stack Monotonic-Stack Hash-Map Next-Greater-Element
單調遞減堆疊處理 nums2，預先建立下一個更大元素對照表，回答 nums1 查詢。
LeetCode 3439: Reschedule Meetings for Maximum Free Time (Sliding Window)
·2 分鐘
LeetCode Daily Medium Array Sliding-Window Two-Pointers Intervals
LeetCode 解題紀錄
LeetCode 30: Substring with Concatenation of All Words
·2 分鐘
LeetCode Daily Hard String Sliding-Window Two-Pointers Hash-Map Brute-Force Frequency-Counting
三種作法：暴力、計數優化、偏移量滑動視窗。
LeetCode 209: Minimum Size Subarray Sum
·1 分鐘
LeetCode Daily Medium Array Sliding-Window Two-Pointers Prefix-Sum Binary-Search
滑動視窗與雙指針，最小化子陣列長度（總和 ≥ target）。
LeetCode 1695: Maximum Erasure Value (Sliding Window)
·1 分鐘
LeetCode Daily Medium Array Sliding-Window Two-Pointers Hash-Set
LeetCode 解題紀錄
LeetCode 1497: Check If Array Pairs Are Divisible by k
·1 分鐘
LeetCode Daily Medium Array Hash-Map Complement Counting Math Modulo
餘數配對與雜湊表；特別處理 0 與 k/2 的餘數。
LeetCode 1071: Greatest Common Divisor of Strings
·1 分鐘
LeetCode Daily Easy String Gcd Math
LeetCode 解題紀錄
LeetCode 2709: Greatest Common Divisor Traversal
·2 分鐘
LeetCode Hard Math Number-Theory Union-Find Sieve Gcd Array
LeetCode 2709 解題筆記：任兩個 index 都能互通 ⇔ 全部在同一個連通塊；用 SPF 分解質因數，數字跟它的質因數在 Union-Find 裡合併；1 要特別處理
LeetCode 2441: Largest Positive Integer That Exists With Its Negative
·1 分鐘
LeetCode Easy Hash-Map Two-Pointers Sorting
LeetCode 2441 解題筆記：把正數和負數的絕對值分開放兩個 set，取交集的最大值；只用絕對值會把同號的重複數字誤判成一對
LeetCode 904: Fruit Into Baskets
·1 分鐘
LeetCode Daily Medium Sliding-Window Variable-Window Two-Pointers Hash-Map
LeetCode 解題紀錄 - 可變大小滑動窗口與雜湊表
LeetCode 76: Minimum Window Substring
·1 分鐘
LeetCode Daily Hard String Sliding-Window Variable-Window Two-Pointers Hash-Map
LeetCode 解題紀錄 - 可變大小滑動窗口與字符計數