<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[coding_diamond的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/coding_diamond</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; coding_diamond]]></copyright><item><title><![CDATA[分糖果问题进阶：NC CD78]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/126423400</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/126423400</guid><author>coding_diamond</author><pubDate>Fri, 19 Aug 2022 13:50:51 +0800</pubDate><description><![CDATA[贪心]]></description><category></category></item><item><title><![CDATA[leetcode 3: 无重复的字符的最长子串]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125718075</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125718075</guid><author>coding_diamond</author><pubDate>Mon, 11 Jul 2022 11:27:00 +0800</pubDate><description><![CDATA[滑动窗口]]></description><category></category></item><item><title><![CDATA[需要背下来的编程题目：]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125635775</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125635775</guid><author>coding_diamond</author><pubDate>Wed, 06 Jul 2022 11:43:52 +0800</pubDate><description><![CDATA[面试背题]]></description><category></category></item><item><title><![CDATA[leetcode 135： 分发糖果]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125633860</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125633860</guid><author>coding_diamond</author><pubDate>Wed, 06 Jul 2022 10:10:32 +0800</pubDate><description><![CDATA[贪心 面试]]></description><category></category></item><item><title><![CDATA[leetcode 93: 复原IP地址 （面试常考）]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125633754</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125633754</guid><author>coding_diamond</author><pubDate>Wed, 06 Jul 2022 10:01:38 +0800</pubDate><description><![CDATA[回溯 深搜 面试]]></description><category></category></item><item><title><![CDATA[单调栈II： leetcode 581、901、42、84]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125595078</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125595078</guid><author>coding_diamond</author><pubDate>Mon, 04 Jul 2022 11:28:41 +0800</pubDate><description><![CDATA[单调栈]]></description><category></category></item><item><title><![CDATA[单调栈 I：leetcode 739、402、316、321]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125593846</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125593846</guid><author>coding_diamond</author><pubDate>Mon, 04 Jul 2022 10:27:24 +0800</pubDate><description><![CDATA[单调栈]]></description><category></category></item><item><title><![CDATA[leetcode 剑指offer 31：栈的压入、弹出序列]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125594099</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125594099</guid><author>coding_diamond</author><pubDate>Mon, 04 Jul 2022 09:51:38 +0800</pubDate><description><![CDATA[栈]]></description><category></category></item><item><title><![CDATA[二维DP： leetcode 1186、]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125522641</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125522641</guid><author>coding_diamond</author><pubDate>Wed, 29 Jun 2022 16:06:52 +0800</pubDate><description><![CDATA[二维动态规划]]></description><category></category></item><item><title><![CDATA[前缀和题型总结 II ：leetcode 1402、1310、1371、1171]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125521703</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125521703</guid><author>coding_diamond</author><pubDate>Wed, 29 Jun 2022 15:08:16 +0800</pubDate><description><![CDATA[前缀和]]></description><category></category></item><item><title><![CDATA[前缀和题型总结 I： leetcode 467、795、904、992、1109]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125517528</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125517528</guid><author>coding_diamond</author><pubDate>Wed, 29 Jun 2022 14:10:24 +0800</pubDate><description><![CDATA[前缀和]]></description><category></category></item><item><title><![CDATA[leetcode 5229： 拼接数组的最大分数]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125468838</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125468838</guid><author>coding_diamond</author><pubDate>Sun, 26 Jun 2022 12:45:47 +0800</pubDate><description><![CDATA[智力问题]]></description><category></category></item><item><title><![CDATA[leetcode 剑指offer 44：数字序列中的某一位数字]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125442930</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125442930</guid><author>coding_diamond</author><pubDate>Fri, 24 Jun 2022 12:07:46 +0800</pubDate><description><![CDATA[数学]]></description><category></category></item><item><title><![CDATA[leetcode 43. 1~n整数中1出现的次数]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125442539</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125442539</guid><author>coding_diamond</author><pubDate>Fri, 24 Jun 2022 11:40:54 +0800</pubDate><description><![CDATA[数学]]></description><category></category></item><item><title><![CDATA[leetcode 剑指offer 14：剪绳子]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125440427</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125440427</guid><author>coding_diamond</author><pubDate>Fri, 24 Jun 2022 10:17:37 +0800</pubDate><description><![CDATA[动态规划]]></description><category></category></item><item><title><![CDATA[leetcode 剑指offer51：数组中的逆序对 归并排序]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125439788</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125439788</guid><author>coding_diamond</author><pubDate>Fri, 24 Jun 2022 09:56:28 +0800</pubDate><description><![CDATA[归并排序]]></description><category></category></item><item><title><![CDATA[leetcode 剑指offer 17. 打印从1 到n的最大n位数 （大数打印）]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125438881</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125438881</guid><author>coding_diamond</author><pubDate>Fri, 24 Jun 2022 09:11:12 +0800</pubDate><description><![CDATA[大数打印]]></description><category></category></item><item><title><![CDATA[leetcode 剑指offer49：丑数]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125424111</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125424111</guid><author>coding_diamond</author><pubDate>Thu, 23 Jun 2022 11:41:39 +0800</pubDate><description><![CDATA[动态规划]]></description><category></category></item><item><title><![CDATA[leetcode 剑指offer 19：正则表达式匹配]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125423678</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125423678</guid><author>coding_diamond</author><pubDate>Thu, 23 Jun 2022 11:32:18 +0800</pubDate><description><![CDATA[动态规划 字符串匹配]]></description><category></category></item><item><title><![CDATA[leetcode5254：卖木头（二维dp）]]></title><link>https://blog.youkuaiyun.com/coding_diamond/article/details/125367670</link><guid>https://blog.youkuaiyun.com/coding_diamond/article/details/125367670</guid><author>coding_diamond</author><pubDate>Mon, 20 Jun 2022 10:36:50 +0800</pubDate><description><![CDATA[二维dp]]></description><category></category></item></channel></rss>