<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
    <channel>
        <title>Backtracking - 标签 - zwyyy456&#39;s blog</title>
        <link>https://doit.tellm.eu.org/zh/tags/backtracking/</link>
        <description>Backtracking - 标签 - 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>Thu, 08 Dec 2022 15:47:34 &#43;0800</lastBuildDate><atom:link href="https://doit.tellm.eu.org/zh/tags/backtracking/" rel="self" type="application/rss+xml" /><item>
    <title>698.划为k个相等的子集</title>
    <link>https://doit.tellm.eu.org/zh/698.partition-to-k-equal-sum-subsets/</link>
    <pubDate>Thu, 08 Dec 2022 15:47:34 &#43;0800</pubDate><author>
                    <name>zwyyy456</name>
                </author><guid>https://doit.tellm.eu.org/zh/698.partition-to-k-equal-sum-subsets/</guid>
    <description><![CDATA[1 问题描述698.划为k个相等的子集 2 解题思路首先，对数组按照从大到小排序，相比从小到大排序，能避免[1, 1, 2, 2]这样的数组的误判; 利用us]]></description>
</item><item>
    <title>131.分割回文串</title>
    <link>https://doit.tellm.eu.org/zh/131.palindrome-patitioning/</link>
    <pubDate>Tue, 06 Dec 2022 19:01:17 &#43;0800</pubDate><author>
                    <name>zwyyy456</name>
                </author><guid>https://doit.tellm.eu.org/zh/131.palindrome-patitioning/</guid>
    <description><![CDATA[1 问题描述131.分割回文串 2 解题思路利用动态规划来判断字符串是否是回文串: - if (s[i] == s[j]) dp[i][j] = dp[i + 1][j - 1]; 这里遍历的时候要注意i的遍历顺序; 最后考]]></description>
</item></channel>
</rss>
