<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[myprogramc的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/myprogramc</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; myprogramc]]></copyright><item><title><![CDATA[km98. 所有可达路径（邻接矩阵+邻接表）]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145912964</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145912964</guid><author>myprogramc</author><pubDate>Thu, 27 Feb 2025 20:56:49 +0800</pubDate><description><![CDATA[【代码】km98. 所有可达路径（邻接矩阵+邻接表）]]></description><category></category></item><item><title><![CDATA[力扣106. 从中序与后序遍历序列构造二叉树]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145821652</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145821652</guid><author>myprogramc</author><pubDate>Mon, 24 Feb 2025 10:04:29 +0800</pubDate><description><![CDATA[【代码】力扣106. 从中序与后序遍历序列构造二叉树。]]></description><category></category></item><item><title><![CDATA[力扣112. 路径总和]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145801061</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145801061</guid><author>myprogramc</author><pubDate>Sat, 22 Feb 2025 21:15:16 +0800</pubDate><description><![CDATA[【代码】力扣112. 路径总和。]]></description><category></category></item><item><title><![CDATA[力扣513. 找树左下角的值（层序+递归）]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145799974</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145799974</guid><author>myprogramc</author><pubDate>Sat, 22 Feb 2025 20:36:37 +0800</pubDate><description><![CDATA[【代码】力扣513. 找树左下角的值（层序+递归）]]></description><category></category></item><item><title><![CDATA[力扣404. 左叶子之和]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145799689</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145799689</guid><author>myprogramc</author><pubDate>Sat, 22 Feb 2025 19:40:08 +0800</pubDate><description><![CDATA[【代码】力扣404. 左叶子之和。]]></description><category></category></item><item><title><![CDATA[力扣257. 二叉树的所有路径]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145775378</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145775378</guid><author>myprogramc</author><pubDate>Fri, 21 Feb 2025 13:38:21 +0800</pubDate><description><![CDATA[【代码】力扣257. 二叉树的所有路径。]]></description><category></category></item><item><title><![CDATA[力扣110. 平衡二叉树]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145774401</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145774401</guid><author>myprogramc</author><pubDate>Fri, 21 Feb 2025 12:36:14 +0800</pubDate><description><![CDATA[【代码】力扣110. 平衡二叉树。]]></description><category></category></item><item><title><![CDATA[力扣222. 完全二叉树的节点个数]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145772916</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145772916</guid><author>myprogramc</author><pubDate>Fri, 21 Feb 2025 11:21:21 +0800</pubDate><description><![CDATA[【代码】力扣222. 完全二叉树的节点个数。]]></description><category></category></item><item><title><![CDATA[力扣111. 二叉树的最小深度]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145772087</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145772087</guid><author>myprogramc</author><pubDate>Fri, 21 Feb 2025 10:54:15 +0800</pubDate><description><![CDATA[【代码】力扣111. 二叉树的最小深度。]]></description><category></category></item><item><title><![CDATA[力扣104. 二叉树的最大深度]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145770349</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145770349</guid><author>myprogramc</author><pubDate>Fri, 21 Feb 2025 10:05:49 +0800</pubDate><description><![CDATA[【代码】力扣104. 二叉树的最大深度。]]></description><category></category></item><item><title><![CDATA[力扣101. 对称二叉树]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145752475</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145752475</guid><author>myprogramc</author><pubDate>Thu, 20 Feb 2025 14:14:29 +0800</pubDate><description><![CDATA[【代码】力扣101. 对称二叉树。]]></description><category></category></item><item><title><![CDATA[力扣226. 翻转二叉树]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145749676</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145749676</guid><author>myprogramc</author><pubDate>Thu, 20 Feb 2025 11:42:28 +0800</pubDate><description><![CDATA[【代码】力扣226. 翻转二叉树。]]></description><category></category></item><item><title><![CDATA[力扣102. 二叉树的层序遍历（非递归法+递归法）]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145747748</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145747748</guid><author>myprogramc</author><pubDate>Thu, 20 Feb 2025 10:51:16 +0800</pubDate><description><![CDATA[【代码】力扣102. 二叉树的层序遍历（非递归法+递归法）]]></description><category></category></item><item><title><![CDATA[十大排序算法]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145699913</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145699913</guid><author>myprogramc</author><pubDate>Tue, 18 Feb 2025 11:44:01 +0800</pubDate><description><![CDATA[从i=1开始，判断nums[i-1]和nums[i]的大小，一直到nums[i]插入到自己的位置。模拟抓扑克牌的过程：将元素插入到已排序的部分，使其有序。2.	左右双指针，左指针找比 pivot 大的元素，右指针找比 pivot 小的元素，然后交换。最坏情况下（如输入数组已经有序），快排可能退化到 O(n²)。3.	直到 left >= right，然后 right 作为新的 pivot 位置。每轮都选一个最小值放到前面，类似“挑选最小的牌放到前面”。•	数组存储（i 位置的子节点：2。]]></description><category></category></item><item><title><![CDATA[力扣144. 二叉树的前序遍历145. 二叉树的后序遍历94. 二叉树的中序遍历（非递归版）]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145687223</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145687223</guid><author>myprogramc</author><pubDate>Mon, 17 Feb 2025 20:36:15 +0800</pubDate><description><![CDATA[的顺序，从先序列遍历的根左右变成了根右左，接着通过reverse变成了左右根，即后序遍历。]]></description><category></category></item><item><title><![CDATA[力扣144. 二叉树的前序遍历145. 二叉树的后序遍历94. 二叉树的中序遍历（递归版）]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145676182</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145676182</guid><author>myprogramc</author><pubDate>Mon, 17 Feb 2025 10:19:22 +0800</pubDate><description><![CDATA[【代码】力扣144. 二叉树的前序遍历145. 二叉树的后序遍历94. 二叉树的中序遍历。]]></description><category></category></item><item><title><![CDATA[力扣347. 前 K 个高频元素]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145630971</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145630971</guid><author>myprogramc</author><pubDate>Sat, 15 Feb 2025 16:11:31 +0800</pubDate><description><![CDATA[【代码】力扣347. 前 K 个高频元素。]]></description><category></category></item><item><title><![CDATA[力扣239. 滑动窗口最大值]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145613056</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145613056</guid><author>myprogramc</author><pubDate>Thu, 13 Feb 2025 15:14:57 +0800</pubDate><description><![CDATA[【代码】力扣239. 滑动窗口最大值。]]></description><category></category></item><item><title><![CDATA[力扣150. 逆波兰表达式求值]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145607468</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145607468</guid><author>myprogramc</author><pubDate>Thu, 13 Feb 2025 11:00:58 +0800</pubDate><description><![CDATA[【代码】力扣150. 逆波兰表达式求值。]]></description><category></category></item><item><title><![CDATA[力扣1047. 删除字符串中的所有相邻重复项]]></title><link>https://blog.youkuaiyun.com/myprogramc/article/details/145606355</link><guid>https://blog.youkuaiyun.com/myprogramc/article/details/145606355</guid><author>myprogramc</author><pubDate>Thu, 13 Feb 2025 10:26:32 +0800</pubDate><description><![CDATA[【代码】力扣1047. 删除字符串中的所有相邻重复项。]]></description><category></category></item></channel></rss>