<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>括号匹配 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/%E6%8B%AC%E5%8F%B7%E5%8C%B9%E9%85%8D/</link><description>Recent content in 括号匹配 on Jeanphilo Blog</description><generator>Hugo -- 0.165.0</generator><language>zh-cn</language><lastBuildDate>Fri, 21 Aug 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E6%8B%AC%E5%8F%B7%E5%8C%B9%E9%85%8D/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 20：有效的括号，为什么数量相同仍然无效</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/20-valid-parentheses/</link><pubDate>Fri, 21 Aug 2026 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/20-valid-parentheses/</guid><description>从反例 ([)] 出发，区分括号数量相同与括号类型、闭合顺序真正匹配，为 LeetCode 20 建立可验证的题意基础。</description></item></channel></rss>