<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_45925322的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_45925322</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_45925322]]></copyright><item><title><![CDATA[Windows删除某文件夹下面所有重复的文件]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/130300988</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/130300988</guid><author>qq_45925322</author><pubDate>Sat, 22 Apr 2023 09:51:12 +0800</pubDate><description><![CDATA[【代码】Windows删除某文件夹下面所有重复的文件。]]></description><category></category></item><item><title><![CDATA[二叉树的遍历]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/129178741</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/129178741</guid><author>qq_45925322</author><pubDate>Thu, 23 Feb 2023 11:56:07 +0800</pubDate><description><![CDATA[二叉树的遍历。
后 + 中 => 层]]></description><category></category></item><item><title><![CDATA[LeetCode 1223. 掷骰子模拟]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/128973630</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/128973630</guid><author>qq_45925322</author><pubDate>Fri, 10 Feb 2023 16:57:47 +0800</pubDate><description><![CDATA[LeetCode 1223. 掷骰子模拟。
暴力递归 -> 记忆化搜索]]></description><category></category></item><item><title><![CDATA[NewCoder 剖分]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/128046477</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/128046477</guid><author>qq_45925322</author><pubDate>Fri, 25 Nov 2022 23:54:28 +0800</pubDate><description><![CDATA[NewCoder 剖分。
树上差分
]]></description><category></category></item><item><title><![CDATA[4721. 排队]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127950974</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127950974</guid><author>qq_45925322</author><pubDate>Sun, 20 Nov 2022 16:53:10 +0800</pubDate><description><![CDATA[4721. 排队。
离散化 + 树状数组]]></description><category></category></item><item><title><![CDATA[NewCoder 排队]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127939771</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127939771</guid><author>qq_45925322</author><pubDate>Sat, 19 Nov 2022 17:57:49 +0800</pubDate><description><![CDATA[NewCoder 排队。
数学（逆序对公式）]]></description><category></category></item><item><title><![CDATA[792. 匹配子序列的单词数]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127907739</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127907739</guid><author>qq_45925322</author><pubDate>Thu, 17 Nov 2022 17:12:55 +0800</pubDate><description><![CDATA[792. 匹配子序列的单词数。
二分查找
状态机预处理]]></description><category></category></item><item><title><![CDATA[4718. 弹球线路]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127889357</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127889357</guid><author>qq_45925322</author><pubDate>Wed, 16 Nov 2022 17:19:33 +0800</pubDate><description><![CDATA[4718. 弹球线路。
并查集]]></description><category></category></item><item><title><![CDATA[LeetCode 6240. 树上最大得分和路径]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127849038</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127849038</guid><author>qq_45925322</author><pubDate>Mon, 14 Nov 2022 15:48:55 +0800</pubDate><description><![CDATA[LeetCode 6240. 树上最大得分和路径。
DFS
]]></description><category></category></item><item><title><![CDATA[LeetCode 6236. 不重叠回文子字符串的最大数目]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127835787</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127835787</guid><author>qq_45925322</author><pubDate>Sun, 13 Nov 2022 19:15:04 +0800</pubDate><description><![CDATA[LeetCode 6236. 不重叠回文子字符串的最大数目。
Hash + DP]]></description><category></category></item><item><title><![CDATA[NC 寻找小竹！]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127814938</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127814938</guid><author>qq_45925322</author><pubDate>Fri, 11 Nov 2022 23:23:44 +0800</pubDate><description><![CDATA[NC 寻找小竹！
并查集 + 质数 + 最大公约数]]></description><category></category></item><item><title><![CDATA[NC 游戏购买！]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127814210</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127814210</guid><author>qq_45925322</author><pubDate>Fri, 11 Nov 2022 22:15:35 +0800</pubDate><description><![CDATA[NC 游戏购买！
BFS
]]></description><category></category></item><item><title><![CDATA[LeetCode 312. 戳气球]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127809249</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127809249</guid><author>qq_45925322</author><pubDate>Fri, 11 Nov 2022 16:54:16 +0800</pubDate><description><![CDATA[LeetCode 312. 戳气球。
区间DP]]></description><category></category></item><item><title><![CDATA[LeetCode 864. 获取所有钥匙的最短路径]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127798549</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127798549</guid><author>qq_45925322</author><pubDate>Thu, 10 Nov 2022 23:45:19 +0800</pubDate><description><![CDATA[LeetCode 864. 获取所有钥匙的最短路径。
BFS + 状态压缩]]></description><category></category></item><item><title><![CDATA[构造数组 -- 差分约束]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127733304</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127733304</guid><author>qq_45925322</author><pubDate>Mon, 07 Nov 2022 16:21:25 +0800</pubDate><description><![CDATA[构造数组 -- 差分约束。
贪心
差分约束]]></description><category></category></item><item><title><![CDATA[LeetCode 6227. 下一个更大元素 IV]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127611966</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127611966</guid><author>qq_45925322</author><pubDate>Mon, 31 Oct 2022 11:16:22 +0800</pubDate><description><![CDATA[LeetCode 6227. 下一个更大元素 IV。
名次树  单调栈]]></description><category></category></item><item><title><![CDATA[4709 三元组]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127469615</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127469615</guid><author>qq_45925322</author><pubDate>Sat, 22 Oct 2022 23:57:58 +0800</pubDate><description><![CDATA[4709 三元组。
树状数组]]></description><category></category></item><item><title><![CDATA[LeetCode 面试题 17.06. 2出现的次数]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127424772</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127424772</guid><author>qq_45925322</author><pubDate>Thu, 20 Oct 2022 12:39:15 +0800</pubDate><description><![CDATA[LeetCode 面试题 17.06. 2出现的次数。
数位DP
]]></description><category></category></item><item><title><![CDATA[LeetCode 902. 最大为 N 的数字组合]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127381679</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127381679</guid><author>qq_45925322</author><pubDate>Tue, 18 Oct 2022 09:32:16 +0800</pubDate><description><![CDATA[LeetCode 902. 最大为 N 的数字组合。
数位DP
]]></description><category></category></item><item><title><![CDATA[Codeforces Round #398 (Div. 2) C. Garland]]></title><link>https://blog.youkuaiyun.com/qq_45925322/article/details/127380054</link><guid>https://blog.youkuaiyun.com/qq_45925322/article/details/127380054</guid><author>qq_45925322</author><pubDate>Tue, 18 Oct 2022 00:19:14 +0800</pubDate><description><![CDATA[Codeforces Round #398 (Div. 2) C. Garland
枚举 + DFS统计子树权值]]></description><category></category></item></channel></rss>