<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[leehal的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/leehal</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; leehal]]></copyright><item><title><![CDATA[代码随想录算法训练营第三十二天 | 122.买卖股票的最佳时机 II，55. 跳跃游戏, 45.跳跃游戏 II[贪心算法篇]]]></title><link>https://blog.csdn.net/leehal/article/details/136406178</link><guid>https://blog.csdn.net/leehal/article/details/136406178</guid><author>leehal</author><pubDate>Fri, 01 Mar 2024 22:14:01 +0800</pubDate><description><![CDATA[买卖股票的最佳时机II、跳跃游戏、贪心算法]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第三十一天 | 455.分发饼干，376. 摆动序列, 53. 最大子序和[贪心算法篇]]]></title><link>https://blog.csdn.net/leehal/article/details/136382369</link><guid>https://blog.csdn.net/leehal/article/details/136382369</guid><author>leehal</author><pubDate>Thu, 29 Feb 2024 23:22:05 +0800</pubDate><description><![CDATA[分发饼干、摆动序列、最大子序和、力扣]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第二十六天 | 39. 组合总和，40.组合总和II, 131.分割回文串[回溯篇]]]></title><link>https://blog.csdn.net/leehal/article/details/136283772</link><guid>https://blog.csdn.net/leehal/article/details/136283772</guid><author>leehal</author><pubDate>Sun, 25 Feb 2024 22:37:07 +0800</pubDate><description><![CDATA[组合总和、分割回文串、回溯法、双指针法]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第二十五天 | 216.组合总和III，17.电话号码的字母组合 [回溯篇]]]></title><link>https://blog.csdn.net/leehal/article/details/136281713</link><guid>https://blog.csdn.net/leehal/article/details/136281713</guid><author>leehal</author><pubDate>Sun, 25 Feb 2024 16:05:05 +0800</pubDate><description><![CDATA[回溯、数字组合、电话号码的字母组合]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第二十四天 | 回溯算法理论基础，77. 组合 [回溯篇]]]></title><link>https://blog.csdn.net/leehal/article/details/136220221</link><guid>https://blog.csdn.net/leehal/article/details/136220221</guid><author>leehal</author><pubDate>Wed, 21 Feb 2024 22:42:20 +0800</pubDate><description><![CDATA[回溯法、组合问题、减枝优化]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第二十三天 | 669. 修剪二叉搜索树，108.将有序数组转换为二叉搜索树，538.把二叉搜索树转换为累加树 [二叉树篇]]]></title><link>https://blog.csdn.net/leehal/article/details/136201005</link><guid>https://blog.csdn.net/leehal/article/details/136201005</guid><author>leehal</author><pubDate>Wed, 21 Feb 2024 00:38:14 +0800</pubDate><description><![CDATA[二叉搜索树、递归]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第二十二天 | 235. 二叉搜索树的最近公共祖先 ，701.二叉搜索树中的插入操作，450.删除二叉搜索树中的节点 [二叉树篇]]]></title><link>https://blog.csdn.net/leehal/article/details/136179944</link><guid>https://blog.csdn.net/leehal/article/details/136179944</guid><author>leehal</author><pubDate>Tue, 20 Feb 2024 23:50:07 +0800</pubDate><description><![CDATA[二叉搜索树、最近公共祖先、插入节点、删除节点]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第十七天 | 110.平衡二叉树，257. 二叉树的所有路径，404.左叶子之和 [二叉树篇]]]></title><link>https://blog.csdn.net/leehal/article/details/136160091</link><guid>https://blog.csdn.net/leehal/article/details/136160091</guid><author>leehal</author><pubDate>Mon, 19 Feb 2024 22:51:02 +0800</pubDate><description><![CDATA[二叉树、平衡二叉树、路径、左右叶子]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第十六天 | 104.二叉树的最大深度，111.二叉树的最小深度，222.完全二叉树的节点个数 [二叉树篇]]]></title><link>https://blog.csdn.net/leehal/article/details/136143091</link><guid>https://blog.csdn.net/leehal/article/details/136143091</guid><author>leehal</author><pubDate>Sun, 18 Feb 2024 22:11:02 +0800</pubDate><description><![CDATA[最大深度、最小深度、二叉树、节点个数，完全二叉树]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第十五天 | 102.二叉树的层序遍历，226.翻转二叉树，101.对称二叉树 [二叉树篇]]]></title><link>https://blog.csdn.net/leehal/article/details/136073398</link><guid>https://blog.csdn.net/leehal/article/details/136073398</guid><author>leehal</author><pubDate>Thu, 08 Feb 2024 00:17:21 +0800</pubDate><description><![CDATA[广度优先遍历、层序遍历、翻转二叉树、C语言]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第十四天 | 144. 二叉树的前序遍历，145.二叉树的后序遍历，94.二叉树的中序遍历 [二叉树篇]]]></title><link>https://blog.csdn.net/leehal/article/details/136063078</link><guid>https://blog.csdn.net/leehal/article/details/136063078</guid><author>leehal</author><pubDate>Wed, 07 Feb 2024 00:01:39 +0800</pubDate><description><![CDATA[二叉树、递归、迭代、前序遍历、中序遍历、后序遍历]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第十三天 | 239. 滑动窗口最大值，347.前 K 个高频元素 [栈与队列篇]]]></title><link>https://blog.csdn.net/leehal/article/details/136048556</link><guid>https://blog.csdn.net/leehal/article/details/136048556</guid><author>leehal</author><pubDate>Tue, 06 Feb 2024 00:31:01 +0800</pubDate><description><![CDATA[滑动窗口最大值、小顶堆、大顶堆、单调队列、C语言、双向链表]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第十一天 | 20. 有效的括号，1047. 删除字符串中的所有相邻重复项，150. 逆波兰表达式求值[栈与队列篇]]]></title><link>https://blog.csdn.net/leehal/article/details/136017673</link><guid>https://blog.csdn.net/leehal/article/details/136017673</guid><author>leehal</author><pubDate>Sun, 04 Feb 2024 00:13:07 +0800</pubDate><description><![CDATA[括号匹配、删除相邻重复项、逆波兰表达式、栈结构]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第十天 | 232.用栈实现队列，225. 用队列实现栈[栈与队列篇]]]></title><link>https://blog.csdn.net/leehal/article/details/136004135</link><guid>https://blog.csdn.net/leehal/article/details/136004135</guid><author>leehal</author><pubDate>Sat, 03 Feb 2024 10:58:49 +0800</pubDate><description><![CDATA[栈、队列、链表]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第九天 | KMP算法学习，28. 实现 strStr()，459.重复的子字符串 [字符串篇]]]></title><link>https://blog.csdn.net/leehal/article/details/135983039</link><guid>https://blog.csdn.net/leehal/article/details/135983039</guid><author>leehal</author><pubDate>Thu, 01 Feb 2024 22:41:51 +0800</pubDate><description><![CDATA[KMP算法应该是我这些天来接解到的真正的算法题，今天视频和讲解文章看了两遍，算是对这个算法有了初步的认识，不得不佩服那些能研究出算法的学者们，想必他们的数学推理逻辑功底何其强大，才能从这具体的世界中抽象出那样像真理般的规律。知识就像一张网，不是二维平面中的网，更像三维空间的网状结构。我们初步学习只是从一个点切入进去了，往往理解地不是很深刻。]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第八天 | 344. 反转字符串，541. 反转字符串II，54. 替换数字，151.翻转字符串里的单词，55. 右旋字符串[字符串篇]]]></title><link>https://blog.csdn.net/leehal/article/details/135961411</link><guid>https://blog.csdn.net/leehal/article/details/135961411</guid><author>leehal</author><pubDate>Thu, 01 Feb 2024 00:00:36 +0800</pubDate><description><![CDATA[字符串处理、字符串反转、双指针、去除特定元素]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第七天 | 454.四数相加II，383. 赎金信，15. 三数之和 ，18. 四数之和[哈希表篇]]]></title><link>https://blog.csdn.net/leehal/article/details/135943360</link><guid>https://blog.csdn.net/leehal/article/details/135943360</guid><author>leehal</author><pubDate>Wed, 31 Jan 2024 00:49:59 +0800</pubDate><description><![CDATA[哈希法、C语言、数组结构、四数相加、三数之和、四数之和]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第六天 | 242.有效的字母异位词，349. 两个数组的交集，202. 快乐数 ， 1. 两数之和 [哈希表篇]]]></title><link>https://blog.csdn.net/leehal/article/details/135921674</link><guid>https://blog.csdn.net/leehal/article/details/135921674</guid><author>leehal</author><pubDate>Mon, 29 Jan 2024 23:15:39 +0800</pubDate><description><![CDATA[哈希表、c语言、set集合、map集合、链表]]></description><category></category></item><item><title><![CDATA[华为OD机试题-滑动窗口最大值(C语言)]]></title><link>https://blog.csdn.net/leehal/article/details/135902651</link><guid>https://blog.csdn.net/leehal/article/details/135902651</guid><author>leehal</author><pubDate>Sun, 28 Jan 2024 23:41:02 +0800</pubDate><description><![CDATA[华为OD机试题、滑动窗口、求最大值]]></description><category></category></item><item><title><![CDATA[代码随想录算法训练营第四天 | 24. 两两交换链表中的节点，19. 删除链表的倒数第 N 个结点，02.07. 链表相交，142. 环形链表 II [链表篇]]]></title><link>https://blog.csdn.net/leehal/article/details/135888045</link><guid>https://blog.csdn.net/leehal/article/details/135888045</guid><author>leehal</author><pubDate>Sat, 27 Jan 2024 23:25:55 +0800</pubDate><description><![CDATA[两两交换链表节点，删除链表节点，链表相交，环形链表，链表操作，双指针法，快慢指针]]></description><category></category></item></channel></rss>