<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[worldinme的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/worldinme</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; worldinme]]></copyright><item><title><![CDATA[LeetCode 动态规划入门第21天]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/123000939</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/123000939</guid><author>worldinme</author><pubDate>Fri, 18 Feb 2022 14:28:42 +0800</pubDate><description><![CDATA[动态规划]]></description><category></category></item><item><title><![CDATA[LeetCode 动态规划入门第20天]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122637095</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122637095</guid><author>worldinme</author><pubDate>Thu, 17 Feb 2022 20:53:08 +0800</pubDate><description><![CDATA[动态规划专题，零钱兑换问题]]></description><category></category></item><item><title><![CDATA[LeetCode 动态规划入门第19天]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122957742</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122957742</guid><author>worldinme</author><pubDate>Thu, 17 Feb 2022 13:00:58 +0800</pubDate><description><![CDATA[动态规划专题，关于字符串之间的匹配]]></description><category></category></item><item><title><![CDATA[LeetCode 动态规划入门第18天]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122937564</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122937564</guid><author>worldinme</author><pubDate>Tue, 15 Feb 2022 11:28:29 +0800</pubDate><description><![CDATA[动态规划，其中第300题的法二很巧妙，利用数组下标表示当前递增子序列的长度]]></description><category></category></item><item><title><![CDATA[LeetCode 动态规划入门第17天]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122920427</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122920427</guid><author>worldinme</author><pubDate>Mon, 14 Feb 2022 11:07:44 +0800</pubDate><description><![CDATA[动态规划字符串专题]]></description><category></category></item><item><title><![CDATA[LeetCode 动态规划入门第16天]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122905915</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122905915</guid><author>worldinme</author><pubDate>Sun, 13 Feb 2022 10:26:55 +0800</pubDate><description><![CDATA[动态规划专题，其中的第二题状态转移方程比较有意思]]></description><category></category></item><item><title><![CDATA[LeetCode 动态规划入门第15天]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122899535</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122899535</guid><author>worldinme</author><pubDate>Sat, 12 Feb 2022 17:45:54 +0800</pubDate><description><![CDATA[今日的动态规划专题没用动态规划，用的dfs+记忆化]]></description><category></category></item><item><title><![CDATA[LeetCode 动态规划入门第14天]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122875518</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122875518</guid><author>worldinme</author><pubDate>Fri, 11 Feb 2022 10:45:17 +0800</pubDate><description><![CDATA[动态规划专题，今日两题均为二维前缀和类型]]></description><category></category></item><item><title><![CDATA[LeetCode 动态规划入门第13天]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122837408</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122837408</guid><author>worldinme</author><pubDate>Wed, 09 Feb 2022 10:53:30 +0800</pubDate><description><![CDATA[动态规划专题，均为基础题]]></description><category></category></item><item><title><![CDATA[LeetCode 动态规划入门第11天]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122824952</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122824952</guid><author>worldinme</author><pubDate>Tue, 08 Feb 2022 15:40:13 +0800</pubDate><description><![CDATA[动态规划第11天，一个用了三个指针，一个巧妙利用二叉搜索树性质]]></description><category></category></item><item><title><![CDATA[LeetCode动态规划入门第10天]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122789609</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122789609</guid><author>worldinme</author><pubDate>Sat, 05 Feb 2022 14:11:48 +0800</pubDate><description><![CDATA[动态规划专题]]></description><category></category></item><item><title><![CDATA[LeetCode 动态规划入门第9天]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122764875</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122764875</guid><author>worldinme</author><pubDate>Tue, 01 Feb 2022 16:58:16 +0800</pubDate><description><![CDATA[动态规划，其中一道借助了哈希表来处理]]></description><category></category></item><item><title><![CDATA[LeetCode 动态规划入门第8天]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122751730</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122751730</guid><author>worldinme</author><pubDate>Sun, 30 Jan 2022 12:23:39 +0800</pubDate><description><![CDATA[动态规划（多状态）]]></description><category></category></item><item><title><![CDATA[LeetCode 动态规划入门第7天]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122749160</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122749160</guid><author>worldinme</author><pubDate>Sat, 29 Jan 2022 23:52:24 +0800</pubDate><description><![CDATA[动态规划专题讲解]]></description><category></category></item><item><title><![CDATA[LeetCode第152题 乘积最大子数组(c++)]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122720108</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122720108</guid><author>worldinme</author><pubDate>Thu, 27 Jan 2022 16:40:32 +0800</pubDate><description><![CDATA[动态规划，依旧是最大子序和的变体，需要同时记录最大值和最小值。]]></description><category></category></item><item><title><![CDATA[LeetCode第918题 环形子数组的最大和(c++)(建议二刷）]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122700418</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122700418</guid><author>worldinme</author><pubDate>Wed, 26 Jan 2022 14:08:44 +0800</pubDate><description><![CDATA[动态规划，58题的升级版]]></description><category></category></item><item><title><![CDATA[LeetCode第740题 删除并获得点数(Java）]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122685041</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122685041</guid><author>worldinme</author><pubDate>Tue, 25 Jan 2022 14:45:30 +0800</pubDate><description><![CDATA[198题打家劫舍的变体，依旧是思路很明确的一个dp]]></description><category></category></item><item><title><![CDATA[LeetCode第55题 跳跃游戏(Java)]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122679574</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122679574</guid><author>worldinme</author><pubDate>Tue, 25 Jan 2022 09:56:58 +0800</pubDate><description><![CDATA[动态规划+贪心]]></description><category></category></item><item><title><![CDATA[LeetCode第213题 打家劫舍 II(c++)]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122678439</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122678439</guid><author>worldinme</author><pubDate>Tue, 25 Jan 2022 07:50:09 +0800</pubDate><description><![CDATA[动态规划，leetcode198题的变体，明确状态转移方程后只要分类讨论即可。]]></description><category></category></item><item><title><![CDATA[LeetCode第53题 最大子数组和(c++dp)(Java分治)（建议二刷）]]></title><link>https://blog.youkuaiyun.com/worldinme/article/details/122647927</link><guid>https://blog.youkuaiyun.com/worldinme/article/details/122647927</guid><author>worldinme</author><pubDate>Sun, 23 Jan 2022 10:17:19 +0800</pubDate><description><![CDATA[动态规划，逐个考虑的思想值得学习。后续分治的思想不错。]]></description><category></category></item></channel></rss>