Shawn’s Blog
🗂️ Collections
🖥️ Slides Gallery
🧠 Q&A Knowledge Base
💻 LeetCode Notes
🧑🍳️ Cooking Ideas
🍱 Cookbook
💬 Language Learning
🎼 Music Library
⚙️ Projects
⚛ Continual Learning Arena
📄 Papers
AdaHAT
FG-AdaHAT
AmnesiacHAT
🎓 CV
CV (English)
CV (Mandarin)
About
最长有效括号
Longest Valid Parentheses
栈
2025/10/16
思路:用栈,看看它最长能连续多少步不会让右括号触底。右括号触底了就跳过,统计归零。
评价:完全正确,秒了
Back to top