<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Locky136的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Locky136</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Locky136]]></copyright><item><title><![CDATA[【LeetCode】每日一题 2024_1_14 超过阈值的最少操作数 I（简单模拟）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/145137699</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/145137699</guid><author>Locky136</author><pubDate>Tue, 14 Jan 2025 14:17:07 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_1_14 超过阈值的最少操作数 I（简单模拟）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_1_13 分割数组的方案数（数组）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/145113537</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/145113537</guid><author>Locky136</author><pubDate>Mon, 13 Jan 2025 13:26:31 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_1_13 分割数组的方案数（数组）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_1_12 按位与结果大于零的最长组合（位运算）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/145092364</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/145092364</guid><author>Locky136</author><pubDate>Sun, 12 Jan 2025 15:16:33 +0800</pubDate><description><![CDATA[每天和你一起刷 LeetCode 每日一题~]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_1_11 求出数字答案（数学/遍历/读题）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/145076762</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/145076762</guid><author>Locky136</author><pubDate>Sat, 11 Jan 2025 14:40:40 +0800</pubDate><description><![CDATA[每天和你一起刷 LeetCode 每日一题~]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_1_10 统计重新排列后包含另一个字符串的子字符串数目 II（滑动窗口）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/145057544</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/145057544</guid><author>Locky136</author><pubDate>Fri, 10 Jan 2025 15:51:18 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_1_10 统计重新排列后包含另一个字符串的子字符串数目 II（滑动窗口）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_12_19 找到稳定山的下标（模拟）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/144583322</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/144583322</guid><author>Locky136</author><pubDate>Thu, 19 Dec 2024 12:57:33 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_12_19 找到稳定山的下标（模拟）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_12_15 数组大小减半（哈希、排序）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/144485451</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/144485451</guid><author>Locky136</author><pubDate>Sun, 15 Dec 2024 13:25:42 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_12_15 数组大小减半（哈希、排序）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_12_13 K 次乘运算后的最终数组 I（暴力）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/144448110</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/144448110</guid><author>Locky136</author><pubDate>Fri, 13 Dec 2024 14:37:55 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_12_13  K 次乘运算后的最终数组 I（暴力）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_12_12 购买物品的最大开销（排序、贪心）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/144424387</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/144424387</guid><author>Locky136</author><pubDate>Thu, 12 Dec 2024 14:16:07 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_12_12 购买物品的最大开销（排序、贪心）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_12_11 半有序排列（分类讨论）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/144396886</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/144396886</guid><author>Locky136</author><pubDate>Wed, 11 Dec 2024 12:10:11 +0800</pubDate><description><![CDATA[每天和你一起刷 LeetCode 每日一题~]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_12_9 判断国际象棋棋盘中一个格子的颜色（找规律）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/144347393</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/144347393</guid><author>Locky136</author><pubDate>Mon, 09 Dec 2024 14:43:02 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_12_9 判断国际象棋棋盘中一个格子的颜色（找规律）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_12_7 骑士在棋盘上的概率（记忆化搜索/DP）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/144308945</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/144308945</guid><author>Locky136</author><pubDate>Sat, 07 Dec 2024 13:51:34 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_12_7 骑士在棋盘上的概率（记忆化搜索/DP）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_12_6 可以被一步捕获的棋子数（模拟）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/144290243</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/144290243</guid><author>Locky136</author><pubDate>Fri, 06 Dec 2024 13:42:09 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_12_6 可以被一步捕获的棋子数（模拟）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_12_5 捕获黑皇后需要的最少移动次数（分类讨论）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/144262749</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/144262749</guid><author>Locky136</author><pubDate>Thu, 05 Dec 2024 13:01:38 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_12_5 捕获黑皇后需要的最少移动次数（分类讨论）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_12_3 检查棋盘方格颜色是否相同（简单题简单做）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/144210384</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/144210384</guid><author>Locky136</author><pubDate>Tue, 03 Dec 2024 11:49:00 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_12_3 检查棋盘方格颜色是否相同（简单题简单做）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_12_1 N 皇后（回溯，DFS）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/144168365</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/144168365</guid><author>Locky136</author><pubDate>Sun, 01 Dec 2024 13:53:33 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_12_1 N 皇后（回溯，DFS）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_11_30 判断是否可以赢得数字游戏（模拟）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/144152322</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/144152322</guid><author>Locky136</author><pubDate>Sat, 30 Nov 2024 11:52:16 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_11_30 判断是否可以赢得数字游戏（模拟）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_11_26 交替组 I（模拟）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/144056226</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/144056226</guid><author>Locky136</author><pubDate>Tue, 26 Nov 2024 13:39:15 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_11_26 交替组 I（模拟）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_11_23 矩阵中的蛇（哈希、计数）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/143990344</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/143990344</guid><author>Locky136</author><pubDate>Sat, 23 Nov 2024 12:56:24 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_11_23 矩阵中的蛇（哈希、计数）]]></description><category></category></item><item><title><![CDATA[【LeetCode】每日一题 2024_11_21 矩阵中的蛇（模拟）]]></title><link>https://blog.youkuaiyun.com/Locky136/article/details/143941466</link><guid>https://blog.youkuaiyun.com/Locky136/article/details/143941466</guid><author>Locky136</author><pubDate>Thu, 21 Nov 2024 13:38:02 +0800</pubDate><description><![CDATA[【LeetCode】每日一题 2024_11_21 矩阵中的蛇（模拟）]]></description><category></category></item></channel></rss>