<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Kerwinstudy的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Kerwinstudy</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Kerwinstudy]]></copyright><item><title><![CDATA[leetcode 17.电话号码的字母组合]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146444095</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146444095</guid><author>Kerwinstudy</author><pubDate>Sat, 22 Mar 2025 18:22:54 +0800</pubDate><description><![CDATA[【代码】leetcode 17.电话号码的字母组合。]]></description><category></category></item><item><title><![CDATA[leetcode 216.组合总和III]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146443487</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146443487</guid><author>Kerwinstudy</author><pubDate>Sat, 22 Mar 2025 17:35:45 +0800</pubDate><description><![CDATA[和77几乎一样，注意终止条件多一个。]]></description><category></category></item><item><title><![CDATA[leetcode 77.组合]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146443263</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146443263</guid><author>Kerwinstudy</author><pubDate>Sat, 22 Mar 2025 17:21:31 +0800</pubDate><description><![CDATA[【代码】leetcode 77.组合。]]></description><category></category></item><item><title><![CDATA[leetcode 257.二叉树的所有路径]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146423332</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146423332</guid><author>Kerwinstudy</author><pubDate>Fri, 21 Mar 2025 16:13:32 +0800</pubDate><description><![CDATA[【代码】leetcode 257.二叉树的所有路径。]]></description><category></category></item><item><title><![CDATA[leetcode 110.平衡二叉树]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146422581</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146422581</guid><author>Kerwinstudy</author><pubDate>Fri, 21 Mar 2025 15:50:49 +0800</pubDate><description><![CDATA[注意递归判断的截至条件。]]></description><category></category></item><item><title><![CDATA[leetcode 222.完全二叉树的节点个数]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146422294</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146422294</guid><author>Kerwinstudy</author><pubDate>Fri, 21 Mar 2025 15:41:57 +0800</pubDate><description><![CDATA[一行搞定，遍历也可以，这样更简单。]]></description><category></category></item><item><title><![CDATA[leetcode 559.N叉树的最大深度]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146422190</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146422190</guid><author>Kerwinstudy</author><pubDate>Fri, 21 Mar 2025 15:38:21 +0800</pubDate><description><![CDATA[【代码】leetcode 559.N叉树的最大深度。]]></description><category></category></item><item><title><![CDATA[leetcode 101.对称二叉树]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146421686</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146421686</guid><author>Kerwinstudy</author><pubDate>Fri, 21 Mar 2025 15:21:34 +0800</pubDate><description><![CDATA[【代码】leetcode 101.对称二叉树。]]></description><category></category></item><item><title><![CDATA[leetcode 226.翻转二叉树]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146420792</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146420792</guid><author>Kerwinstudy</author><pubDate>Fri, 21 Mar 2025 14:52:49 +0800</pubDate><description><![CDATA[【代码】leetcode 226.翻转二叉树。]]></description><category></category></item><item><title><![CDATA[leetcode 111.二叉树的最小深度]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146420533</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146420533</guid><author>Kerwinstudy</author><pubDate>Fri, 21 Mar 2025 14:44:31 +0800</pubDate><description><![CDATA[【代码】leetcode 111.二叉树的最小深度。]]></description><category></category></item><item><title><![CDATA[leetcode 104.二叉树的最大深度]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146420275</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146420275</guid><author>Kerwinstudy</author><pubDate>Fri, 21 Mar 2025 14:36:44 +0800</pubDate><description><![CDATA[【代码】leetcode 104.二叉树的最大深度。]]></description><category></category></item><item><title><![CDATA[leetcode 117.填充每个节点的下一个右侧节点II]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146419038</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146419038</guid><author>Kerwinstudy</author><pubDate>Fri, 21 Mar 2025 13:48:28 +0800</pubDate><description><![CDATA[同样的内容，可以再写一遍练习一下。]]></description><category></category></item><item><title><![CDATA[leetcode 116.填充每个节点的下一个右侧指针]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146418759</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146418759</guid><author>Kerwinstudy</author><pubDate>Fri, 21 Mar 2025 13:35:38 +0800</pubDate><description><![CDATA[将原来插入队列的部分改为修改下一个指针。]]></description><category></category></item><item><title><![CDATA[leetcode 515.在每个树行中找最大值]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146399862</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146399862</guid><author>Kerwinstudy</author><pubDate>Thu, 20 Mar 2025 16:10:06 +0800</pubDate><description><![CDATA[【代码】leetcode 515.在每个树行中找最大值。]]></description><category></category></item><item><title><![CDATA[leetcode 429.N叉树的层序遍历]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146398205</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146398205</guid><author>Kerwinstudy</author><pubDate>Thu, 20 Mar 2025 15:19:12 +0800</pubDate><description><![CDATA[【代码】leetcode 429.N叉树的层序遍历。]]></description><category></category></item><item><title><![CDATA[leetcode 637.二叉树的层平均值]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146397643</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146397643</guid><author>Kerwinstudy</author><pubDate>Thu, 20 Mar 2025 15:05:19 +0800</pubDate><description><![CDATA[【代码】leetcode 637.二叉树的层平均值。]]></description><category></category></item><item><title><![CDATA[leetcode 199.二叉树的右视图]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146397386</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146397386</guid><author>Kerwinstudy</author><pubDate>Thu, 20 Mar 2025 14:59:23 +0800</pubDate><description><![CDATA[【代码】leetcode 199.二叉树的右视图。]]></description><category></category></item><item><title><![CDATA[leetcode 107.二叉树的层序遍历]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146397245</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146397245</guid><author>Kerwinstudy</author><pubDate>Thu, 20 Mar 2025 14:55:23 +0800</pubDate><description><![CDATA[【代码】leetcode 107.二叉树的层序遍历。]]></description><category></category></item><item><title><![CDATA[leetcode 102.二叉树的层序遍历]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146397063</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146397063</guid><author>Kerwinstudy</author><pubDate>Thu, 20 Mar 2025 14:50:03 +0800</pubDate><description><![CDATA[【代码】leetcode 102.二叉树的层序遍历。]]></description><category></category></item><item><title><![CDATA[leetcode 94.二叉树的中序遍历]]></title><link>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146379610</link><guid>https://blog.youkuaiyun.com/Kerwinstudy/article/details/146379610</guid><author>Kerwinstudy</author><pubDate>Wed, 19 Mar 2025 20:23:04 +0800</pubDate><description><![CDATA[【代码】leetcode 94.二叉树的中序遍历。]]></description><category></category></item></channel></rss>