<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[gronkie的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_52212261</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_52212261]]></copyright><item><title><![CDATA[leetcode 困难 —— 寻找旋转排序数组中的最小值 I，II（二分 + 特判）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/130137545</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/130137545</guid><author>m0_52212261</author><pubDate>Thu, 13 Apr 2023 22:38:06 +0800</pubDate><description><![CDATA[leetcode 困难 —— 寻找旋转排序数组中的最小值 I，II（二分 + 特判）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 买卖股票的最佳时机 IV（详细思路，很妙的dp题）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129770468</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129770468</guid><author>m0_52212261</author><pubDate>Sat, 25 Mar 2023 20:17:50 +0800</pubDate><description><![CDATA[（如何构建dp数组，状态转移方程建立，还有 边缘考虑 都比较复杂，很妙的题）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 地下城游戏（简单dp）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129766511</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129766511</guid><author>m0_52212261</author><pubDate>Sat, 25 Mar 2023 14:25:29 +0800</pubDate><description><![CDATA[leetcode 困难 —— 地下城游戏（简单dp）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 买卖股票的最佳时机 III（简单逻辑）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129765981</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129765981</guid><author>m0_52212261</author><pubDate>Sat, 25 Mar 2023 13:38:30 +0800</pubDate><description><![CDATA[leetcode 困难 —— 买卖股票的最佳时机 III（简单逻辑）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 排列序列（简单逻辑）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129589134</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129589134</guid><author>m0_52212261</author><pubDate>Thu, 16 Mar 2023 18:37:05 +0800</pubDate><description><![CDATA[leetcode 困难 —— 排列序列（简单逻辑）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 分发糖果（简单逻辑）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129567041</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129567041</guid><author>m0_52212261</author><pubDate>Wed, 15 Mar 2023 20:35:54 +0800</pubDate><description><![CDATA[leetcode 困难 —— 分发糖果（简单逻辑）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 解数独（简单递归）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129551429</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129551429</guid><author>m0_52212261</author><pubDate>Wed, 15 Mar 2023 12:52:38 +0800</pubDate><description><![CDATA[（有点类似于 N 皇后，就是通过递归找可能的解法）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— K 个一组翻转链表（简单模拟）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129504301</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129504301</guid><author>m0_52212261</author><pubDate>Mon, 13 Mar 2023 20:04:49 +0800</pubDate><description><![CDATA[（思路很简单，但需要把思路捋清楚，不然还是会卡）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 不同的子序列（dp）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129462170</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129462170</guid><author>m0_52212261</author><pubDate>Sat, 11 Mar 2023 13:26:17 +0800</pubDate><description><![CDATA[leetcode 困难 —— 不同的子序列（dp）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 分割回文串 II（dp）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129460772</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129460772</guid><author>m0_52212261</author><pubDate>Sat, 11 Mar 2023 11:31:20 +0800</pubDate><description><![CDATA[leetcode 困难 —— 分割回文串 II（dp）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 外星文字典（拓扑排序）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129351593</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129351593</guid><author>m0_52212261</author><pubDate>Sun, 05 Mar 2023 21:55:35 +0800</pubDate><description><![CDATA[leetcode 困难 —— 外星文字典（拓扑排序）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 相似字符串组（并查集）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129347156</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129347156</guid><author>m0_52212261</author><pubDate>Sun, 05 Mar 2023 16:14:52 +0800</pubDate><description><![CDATA[leetcode 困难 —— 相似字符串组（并查集）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 数据流的中位数（优先队列）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129333679</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129333679</guid><author>m0_52212261</author><pubDate>Sat, 04 Mar 2023 14:21:08 +0800</pubDate><description><![CDATA[leetcode 困难 —— 数据流的中位数（优先队列）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 单词拆分 II（深搜 + 剪枝）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129331980</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129331980</guid><author>m0_52212261</author><pubDate>Sat, 04 Mar 2023 11:19:02 +0800</pubDate><description><![CDATA[leetcode 困难 —— 单词拆分 II（深搜 + 剪枝）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 天际线问题（优先队列）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129260012</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129260012</guid><author>m0_52212261</author><pubDate>Tue, 28 Feb 2023 14:35:18 +0800</pubDate><description><![CDATA[（思路感觉挺明显的，就是一些特殊情况得考虑清楚）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 矩阵中的最长递增路径（简单深搜）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129237372</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129237372</guid><author>m0_52212261</author><pubDate>Mon, 27 Feb 2023 10:46:52 +0800</pubDate><description><![CDATA[leetcode 困难 —— 矩阵中的最长递增路径（简单深搜）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 直线上最多的点数（简单逻辑题）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129231674</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129231674</guid><author>m0_52212261</author><pubDate>Sun, 26 Feb 2023 21:20:43 +0800</pubDate><description><![CDATA[（非常简单的一道逻辑题）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 计算右侧小于当前元素的个数（分治法）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129215978</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129215978</guid><author>m0_52212261</author><pubDate>Sat, 25 Feb 2023 15:20:40 +0800</pubDate><description><![CDATA[（可以先去看看 leetcode 困难 —— 数组中的逆序对（分治法），几乎一样，稍微简单一点点）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 数组中的逆序对（分治法）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129214322</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129214322</guid><author>m0_52212261</author><pubDate>Sat, 25 Feb 2023 13:53:28 +0800</pubDate><description><![CDATA[leetcode 困难 —— 数组中的逆序对（分治法）]]></description><category></category></item><item><title><![CDATA[leetcode 困难 —— 数字 1 的个数（简单逻辑题）]]></title><link>https://blog.youkuaiyun.com/m0_52212261/article/details/129048439</link><guid>https://blog.youkuaiyun.com/m0_52212261/article/details/129048439</guid><author>m0_52212261</author><pubDate>Wed, 15 Feb 2023 19:09:18 +0800</pubDate><description><![CDATA[（害，做题是真的慢，这面试给我这题我估计就傻了）]]></description><category></category></item></channel></rss>