Bracket-Sequences onhttps://h30306.github.io/blog/zh-tw/tags/bracket-sequences/Recent content in Bracket-Sequences onHugo -- gohugo.iozh-twhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungTue, 03 Nov 2026 00:00:00 +0000LeetCode 32: Longest Valid Parentheseshttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-32/Tue, 03 Nov 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-32/LeetCode 32 解題筆記：堆疊存索引，底部放目前這段合法括號開始前的位置，長度是 i - stack[-1]LeetCode 2267: Check if There Is a Valid Parentheses String Pathhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-2267/Tue, 13 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-2267/LeetCode 2267 解題筆記：狀態是 (r, c, 左括號餘額)；餘額不能是負的，也不能超過剩下的步數；BFS / DP 搜尋這些狀態，走到終點時餘額為 0 就成立LeetCode 1021: Remove Outermost Parentheseshttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-1021/Tue, 27 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1021/LeetCode 1021 解題筆記：用深度計數取代 stack，深度從 0 變 1 的左括號和從 1 變 0 的右括號是外層，其他都保留