<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[不浪拉面的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/chenkanghaoo</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; chenkanghaoo]]></copyright><item><title><![CDATA[刷怪日记-飞地数量]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/140838722</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/140838722</guid><author>chenkanghaoo</author><pubDate>Thu, 01 Aug 2024 09:24:16 +0800</pubDate><description><![CDATA[【代码】刷怪日记-飞地数量。]]></description><category></category></item><item><title><![CDATA[刷怪日记-回文链表]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/138231744</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/138231744</guid><author>chenkanghaoo</author><pubDate>Fri, 26 Apr 2024 22:21:13 +0800</pubDate><description><![CDATA[【代码】刷怪日记-回文链表。]]></description><category></category></item><item><title><![CDATA[刷怪日记-01 背包理论问题(一维数组实现)]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136499308</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136499308</guid><author>chenkanghaoo</author><pubDate>Wed, 06 Mar 2024 10:45:04 +0800</pubDate><description><![CDATA[二维数组遍历背包不采用倒序遍历，是因为dp[i] [j]是由其上方推导出来的，并不会覆盖本层dp[i] [j]的值。dp[2] = dp[2 - weight[0]] + value[0] = 15 （dp数组已经都初始化为0）按照上述推导公式，遍历物品i时，发现物品i被放进去俩次,dp[2]等于30。假设物品价值都是大于0的，所以dp数组初始化的时候，都初始为0就可以了。正上方**推导出来，并且每一个维度都可以覆盖上一个维度的值。遍历背包与二维数组方式不一样，一维数组采用倒序方式，主。]]></description><category></category></item><item><title><![CDATA[刷怪日记-01背包理论问题(二维矩阵实现)]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136498367</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136498367</guid><author>chenkanghaoo</author><pubDate>Wed, 06 Mar 2024 10:23:04 +0800</pubDate><description><![CDATA[本题采用二维数组进行解题，那么dp[i] [j]表示从下标0-i的物品任意选择，放进容量为j背包，价值总合最大是多少。i 表示物品第几个物品，j 表示背包容量大小。]]></description><category></category></item><item><title><![CDATA[刷怪日记-不同路径Ⅱ]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136381262</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136381262</guid><author>chenkanghaoo</author><pubDate>Thu, 29 Feb 2024 21:13:35 +0800</pubDate><description><![CDATA[动态规划的思想，由上一步状态推出下一步状态，因此在统计到[i, j]格的路径之前，可以先统计[i-1, j]、[i, j-1]的路径，再通过前一步格子求出下一步格子的路径。，假如说在第一行或第一列碰见障碍物(1)，其同一行\同一列的后面元素路径数均为0，因为后面走不通啦。矩阵[m, n]的第一行和第一列，均只能单方向前进，因此行进路径只有。若排除上述情况，那么在某格遇见障碍物将该格设置为0。]]></description><category></category></item><item><title><![CDATA[刷怪日记-单调递增的数字]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136381243</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136381243</guid><author>chenkanghaoo</author><pubDate>Thu, 29 Feb 2024 21:12:34 +0800</pubDate><description><![CDATA[【代码】刷怪日记-单调递增的数字。]]></description><category></category></item><item><title><![CDATA[刷怪日记-用最少数量的箭引爆气球]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136381220</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136381220</guid><author>chenkanghaoo</author><pubDate>Thu, 29 Feb 2024 21:11:54 +0800</pubDate><description><![CDATA[为了尽可能让气球重叠，需要对数组进行排序，依据[a,b]中a或b排序均可，只是计算不同，本题是对a进行排序。如果气球重叠了，重叠气球中右边界的最小值之前的区间一定需要一个弓箭。贪心算法，局部最优推全局最优。]]></description><category></category></item><item><title><![CDATA[刷怪日记-分发糖果]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136280532</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136280532</guid><author>chenkanghaoo</author><pubDate>Sun, 25 Feb 2024 11:45:42 +0800</pubDate><description><![CDATA[【代码】刷怪日记-分发糖果。]]></description><category></category></item><item><title><![CDATA[刷怪日记-根据身高重建队列]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136280507</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136280507</guid><author>chenkanghaoo</author><pubDate>Sun, 25 Feb 2024 11:45:06 +0800</pubDate><description><![CDATA[【代码】刷怪日记-根据身高重建队列。]]></description><category></category></item><item><title><![CDATA[刷怪日记-跳跃游戏]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136244902</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136244902</guid><author>chenkanghaoo</author><pubDate>Thu, 22 Feb 2024 23:04:49 +0800</pubDate><description><![CDATA[【代码】刷怪日记-跳跃游戏。]]></description><category></category></item><item><title><![CDATA[刷怪日记-重新安排行程]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136222998</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/136222998</guid><author>chenkanghaoo</author><pubDate>Wed, 21 Feb 2024 23:40:44 +0800</pubDate><description><![CDATA[将每个航班的终点站进行对比，小的排前面，从而实现字母小的先使用，比如说初始站相同，那么终点站字母小的就在前面先使用了。回溯遍历的过程中，遇到的机场个数，如果达到了（航班数量+1），那么就找到了一个行程，把所有航班串在一起了。通过used[]数组记录航班使用情况，已使用记录为false，从而避免重复。]]></description><category></category></item><item><title><![CDATA[刷怪日记-修剪二叉搜索树]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135737866</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135737866</guid><author>chenkanghaoo</author><pubDate>Sun, 21 Jan 2024 23:36:51 +0800</pubDate><description><![CDATA[此题需要采用后序遍历解决，因为可能删除多个节点，如果先序遍历，可能头节点符合删除要求，就直接停止遍历了。]]></description><category></category></item><item><title><![CDATA[刷怪日记-删除二叉搜索树中的节点]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135737839</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135737839</guid><author>chenkanghaoo</author><pubDate>Sun, 21 Jan 2024 23:35:47 +0800</pubDate><description><![CDATA[这道题采用前序遍历和后序遍历均可，需要搜索整个树，本算法使用后序遍历。]]></description><category></category></item><item><title><![CDATA[刷怪日记-二叉树的最近公共祖先]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135724088</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135724088</guid><author>chenkanghaoo</author><pubDate>Sat, 20 Jan 2024 23:46:10 +0800</pubDate><description><![CDATA[看见这道题首先应该想到**自下向上**遍历，**最近公共祖先**应该先找到p和q，然后再往上找最近公共祖先。]]></description><category></category></item><item><title><![CDATA[刷怪日记-二叉搜索树中的众数]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135723570</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135723570</guid><author>chenkanghaoo</author><pubDate>Sat, 20 Jan 2024 22:59:41 +0800</pubDate><description><![CDATA[二叉搜索树经过**中序遍历**可以看作有序数组。]]></description><category></category></item><item><title><![CDATA[刷怪日记-从中序与后序遍历序列构造二叉树]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135574838</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135574838</guid><author>chenkanghaoo</author><pubDate>Sat, 13 Jan 2024 20:00:59 +0800</pubDate><description><![CDATA[观察中序和后序遍历数组，可以发现后序遍历数组末尾元素往往是根节点，例如末尾元素3就是根节点，而元素3在中序遍历数组中刚好可以切割数组为左右子树俩部分。]]></description><category></category></item><item><title><![CDATA[刷怪日记-路径总和Ⅱ]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135561722</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135561722</guid><author>chenkanghaoo</author><pubDate>Fri, 12 Jan 2024 20:56:02 +0800</pubDate><description><![CDATA[首先确定递归三步曲，此题是从根节点到叶子节点的路径，**自顶向下**，因此采用**先序遍历**递归设计]]></description><category></category></item><item><title><![CDATA[刷怪日记-自底向下解决二叉平衡树]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135561671</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135561671</guid><author>chenkanghaoo</author><pubDate>Fri, 12 Jan 2024 20:54:42 +0800</pubDate><description><![CDATA[明确递归三步曲，自底向上递归，时间复杂度为O(n)，每个节点仅访问依次，空间复杂度O(n)，取决于递归调用层数，递归调用层数不会超过n]]></description><category></category></item><item><title><![CDATA[刷怪日记-层序遍历一般应用场景]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135486568</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135486568</guid><author>chenkanghaoo</author><pubDate>Tue, 09 Jan 2024 17:57:25 +0800</pubDate><description><![CDATA[层序遍历：即逐层地，从左到右依次访问所有节点]]></description><category></category></item><item><title><![CDATA[刷题日记-利用递归和栈实现二叉树三种遍历方式]]></title><link>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135350017</link><guid>https://blog.youkuaiyun.com/chenkanghaoo/article/details/135350017</guid><author>chenkanghaoo</author><pubDate>Tue, 02 Jan 2024 21:25:36 +0800</pubDate><description><![CDATA[递归和迭代主要区别在于：**递归的时候隐式的维护了一个栈，相当于不停的自身调用自身，迭代则是需要显式的将这个栈实现出来**]]></description><category></category></item></channel></rss>