<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[周一心情拯救者]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/KKsteve</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; KKsteve]]></copyright><item><title><![CDATA[算法训练 Day 60]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128460655</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128460655</guid><author>KKsteve</author><pubDate>Tue, 27 Dec 2022 21:02:46 +0800</pubDate><description><![CDATA[LeetCode 关于单调栈——柱状图中最大的矩形的思路和方法，单调栈的思想是递增或者递减，要明确这一点，才能在之后遍历，分析情况的时候不乱。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 59]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128460054</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128460054</guid><author>KKsteve</author><pubDate>Tue, 27 Dec 2022 19:35:48 +0800</pubDate><description><![CDATA[LeetCode 关于单调栈的两道经典题目，如果面试的时候一时想不到单调栈的方法，也可以先使用别的方法将题目ac出来。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 58]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128454340</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128454340</guid><author>KKsteve</author><pubDate>Tue, 27 Dec 2022 18:47:20 +0800</pubDate><description><![CDATA[LeetCode 关于单调栈的两道题，单调栈相当于用空间换时间，在遍历的同时记录下一些信息来避免进行二次遍历。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 57]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128449272</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128449272</guid><author>KKsteve</author><pubDate>Tue, 27 Dec 2022 12:22:52 +0800</pubDate><description><![CDATA[LeetCode 关于动态规划——回文串、回文序列的问题，做这种题的时候一定要清楚要我们求解的子序列是否连续。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 56]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128448762</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128448762</guid><author>KKsteve</author><pubDate>Mon, 26 Dec 2022 20:34:53 +0800</pubDate><description><![CDATA[LeetCode 关于编辑距离的思路和代码，编辑距离还是一道非常经典的动态规划题目，与打家劫舍的重要性不相上下。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 55]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128446411</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128446411</guid><author>KKsteve</author><pubDate>Mon, 26 Dec 2022 17:16:35 +0800</pubDate><description><![CDATA[LeetCode 关于子序列的两道题目，均使用动态规划的思想，难度逐步提升。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 53]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128442111</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128442111</guid><author>KKsteve</author><pubDate>Mon, 26 Dec 2022 16:16:13 +0800</pubDate><description><![CDATA[LeetCode 关于子序列和子数组的三道题，有时候题目乍一看没有直接使用动规的迹象，还是要仔细分析题目。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 52]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128435174</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128435174</guid><author>KKsteve</author><pubDate>Sun, 25 Dec 2022 17:08:53 +0800</pubDate><description><![CDATA[LeetCode 关于动规——子序列的三道题，要活用动规五部曲。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 51]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128366437</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128366437</guid><author>KKsteve</author><pubDate>Sun, 18 Dec 2022 23:52:12 +0800</pubDate><description><![CDATA[LeetCode 关于买卖股票的两道题，使用动态规划的思路。写这篇博客的时候阿根廷已经2：0法国了，希望梅老板夺冠！]]></description><category></category></item><item><title><![CDATA[算法训练 Day 50]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128346905</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128346905</guid><author>KKsteve</author><pubDate>Sat, 17 Dec 2022 13:06:10 +0800</pubDate><description><![CDATA[LeetCode 关于动态规划--买卖股票的进阶版，两道题思路一致，是非常不错的动规好题。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 49]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128330205</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128330205</guid><author>KKsteve</author><pubDate>Thu, 15 Dec 2022 21:10:17 +0800</pubDate><description><![CDATA[LeetCode 关于动态规划--买卖股票的两道专项训练。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 48]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128320423</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128320423</guid><author>KKsteve</author><pubDate>Wed, 14 Dec 2022 22:40:26 +0800</pubDate><description><![CDATA[LeetCode 三道打家劫舍的题，打家劫舍是非常经典的动态规划类题目，需要好好揣摩。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 46]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128300356</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128300356</guid><author>KKsteve</author><pubDate>Tue, 13 Dec 2022 22:20:49 +0800</pubDate><description><![CDATA[LeetCode 关于动态规划多重背包的一道题。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 45]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128292140</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128292140</guid><author>KKsteve</author><pubDate>Mon, 12 Dec 2022 22:04:28 +0800</pubDate><description><![CDATA[LeetCode 关于动态规划--完全背包问题的三道题，完全背包跟01背包的区别就在于物品能不能多次进行选择。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 44]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128259510</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128259510</guid><author>KKsteve</author><pubDate>Fri, 09 Dec 2022 22:09:50 +0800</pubDate><description><![CDATA[LeetCode 关于完全背包的两题，而且这两题很有针对性的考察了对排列顺序的注重，不同的情况需要进行不同的应变。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 43]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128242505</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128242505</guid><author>KKsteve</author><pubDate>Thu, 08 Dec 2022 22:46:55 +0800</pubDate><description><![CDATA[LeetCode 关于动态规划的三题，难度不小，还是需要仔细揣摩动规，利用好动规五部曲。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 42]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128217456</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128217456</guid><author>KKsteve</author><pubDate>Wed, 07 Dec 2022 11:55:46 +0800</pubDate><description><![CDATA[LeetCode 关于动态规划——01背包的一道应用算法题，01背包是动态规划的进阶思想，比较难掌握，需要多揣摩，多举例思考。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 41]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128193313</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128193313</guid><author>KKsteve</author><pubDate>Mon, 05 Dec 2022 22:22:47 +0800</pubDate><description><![CDATA[LeetCode 关于动态规划的两道题的思路和代码，动态规划是一种非常精彩的思想，其寻找内在的一种规律来减少暴力搜索的时间。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 39]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128163539</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128163539</guid><author>KKsteve</author><pubDate>Sat, 03 Dec 2022 21:12:12 +0800</pubDate><description><![CDATA[LeetCode 关于动态规划的两道题——不同路径和不同路径II，都是用的最经典的动规五部曲的思想，题目本身并不难。]]></description><category></category></item><item><title><![CDATA[算法训练 Day 38]]></title><link>https://blog.youkuaiyun.com/KKsteve/article/details/128155013</link><guid>https://blog.youkuaiyun.com/KKsteve/article/details/128155013</guid><author>KKsteve</author><pubDate>Fri, 02 Dec 2022 22:29:23 +0800</pubDate><description><![CDATA[LeetCode 关于动规比较简单的三道题，练练手，动规的重要性值得任何LeetCode人的注意。]]></description><category></category></item></channel></rss>