<?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%A3%8B%E7%9B%98/</link><description>Recent content in 棋盘 on Jeanphilo Blog</description><generator>Hugo -- 0.161.1</generator><language>zh-cn</language><lastBuildDate>Sun, 19 Apr 2026 00:09:28 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E6%A3%8B%E7%9B%98/index.xml" rel="self" type="application/rss+xml"/><item><title>Hot100：N 皇后严格增量构建教程</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/backtracking/51-n-queens/</link><pubDate>Sun, 19 Apr 2026 00:09:28 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/backtracking/51-n-queens/</guid><description>用严格增量构建的方式讲解 LeetCode 51 N 皇后：从最小例子、最小 DFS 骨架，到第一版正确解，再到列与对角线状态优化。</description></item></channel></rss>