<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
    <channel>
        <title>Backtracking Algorithm - 标签 - zwyyy456&#39;s blog</title>
        <link>https://doit.tellm.eu.org/zh/tags/backtracking-algorithm/</link>
        <description>Backtracking Algorithm - 标签 - zwyyy456&#39;s blog</description>
        <generator>Hugo -- gohugo.io</generator><language>zh</language><managingEditor>zwyyy456@hotmail.com (zwyyy456)</managingEditor>
            <webMaster>zwyyy456@hotmail.com (zwyyy456)</webMaster><copyright>This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.</copyright><lastBuildDate>Mon, 26 Sep 2022 15:03:27 &#43;0800</lastBuildDate><atom:link href="https://doit.tellm.eu.org/zh/tags/backtracking-algorithm/" rel="self" type="application/rss+xml" /><item>
    <title>37.sudoku Solver 解数独</title>
    <link>https://doit.tellm.eu.org/zh/37.sudoku-solver/</link>
    <pubDate>Mon, 26 Sep 2022 15:03:27 &#43;0800</pubDate><author>
                    <name>zwyyy456</name>
                </author><guid>https://doit.tellm.eu.org/zh/37.sudoku-solver/</guid>
    <description><![CDATA[1 题目描述链接：37.Sodoku Solver 2 解题思路相比一般的回溯，需要两层for循环，一个处理行，一个处理列，递归的过程来决定，空格处到底填哪个]]></description>
</item><item>
    <title>47.permutations-ii 全排列 II</title>
    <link>https://doit.tellm.eu.org/zh/47.permutations-ii/</link>
    <pubDate>Sun, 25 Sep 2022 22:05:03 &#43;0800</pubDate><author>
                    <name>zwyyy456</name>
                </author><guid>https://doit.tellm.eu.org/zh/47.permutations-ii/</guid>
    <description><![CDATA[1 问题描述47.全排列 II 2 解题思路相比全排列，多了重复数字的干扰，可以参照带重复数字的组合问题来进行去重： if (used[i] == 1)判断nums[i]是否已]]></description>
</item><item>
    <title>51.n 皇后</title>
    <link>https://doit.tellm.eu.org/zh/51.n-queens/</link>
    <pubDate>Sun, 25 Sep 2022 21:42:57 &#43;0800</pubDate><author>
        <name>zwyyy456</name>
    </author><guid>https://doit.tellm.eu.org/zh/51.n-queens/</guid>
    <description><![CDATA[1 问题描述51.n 皇后 2 解题思路典型的回溯，注意如何判断棋子在同一斜线上。 3 代码 cpp class Solution { private: int row_col[17] = {0}; int row_plus_col[17] = {0}; int row_arr[9] = {9, 9, 9, 9, 9, 9, 9, 9, 9}; int col_arr[9] = {0}; //]]></description>
</item></channel>
</rss>
