<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[chengchencheng的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/chengchencheng</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; chengchencheng]]></copyright><item><title><![CDATA[【面试题59 - II. 队列的最大值】（普通队列）]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127720899</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127720899</guid><author>chengchencheng</author><pubDate>Sun, 06 Nov 2022 20:51:56 +0800</pubDate><description><![CDATA[刚开始用了优先队列PriorityQueue，在一组测试样例中过不了，输出总是[], [], [], [], [], [], [], 16, [], 22，正确答案应该是[], [], [], [], [], [], [], 96, [], 16。经过调试，终于想起了，这是优先队列，默认将队列按照升序排列，而此题应该使用普通队列。]]></description><category></category></item><item><title><![CDATA[【面试题13. 机器人的运动范围】（回溯）]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127717594</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127717594</guid><author>chengchencheng</author><pubDate>Sun, 06 Nov 2022 16:44:07 +0800</pubDate><description><![CDATA[这道题说的不清楚，其实包含一个隐含条件：不可达的方格相当于障碍物，不能通过不可达的方格到达别的符合条件的方格。如这个图中，上面那块符合条件的方格是可达的，但是无法到达下面符合条件的区域。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 68 - II. 二叉树的最近公共祖先】（同上一题一样）]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127716539</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127716539</guid><author>chengchencheng</author><pubDate>Sun, 06 Nov 2022 15:38:12 +0800</pubDate><description><![CDATA[思路和代码和上一题相同。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 68 - I. 二叉搜索树的最近公共祖先】]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127716442</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127716442</guid><author>chengchencheng</author><pubDate>Sun, 06 Nov 2022 15:34:19 +0800</pubDate><description><![CDATA[如果节点c为目标节点之一，且c.right及其子树中包含另一个目标节点，那么c是最近公共祖先；如果节点c为目标节点之一，且c.left及其子树中包含另一个目标节点，那么c是最近公共祖先；如果c的左右子树中都包含目标节点，那么c是最近公共祖先。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 67. 把字符串转换成整数】（有限状态机）]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127696534</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127696534</guid><author>chengchencheng</author><pubDate>Sun, 06 Nov 2022 14:59:02 +0800</pubDate><description><![CDATA[能挣扎一下，但不多（大哭……]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 66. 构建乘积数组】（很巧妙）]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127640222</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127640222</guid><author>chengchencheng</author><pubDate>Tue, 01 Nov 2022 20:03:11 +0800</pubDate><description><![CDATA[左边和右边分别乘起来，最后两者再相乘。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 65. 不用加减乘除做加法】（位运算）]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127603434</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127603434</guid><author>chengchencheng</author><pubDate>Sun, 30 Oct 2022 19:25:58 +0800</pubDate><description><![CDATA[【代码】【剑指 Offer 65. 不用加减乘除做加法】（位运算）]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 64. 求1+2+…+n】（递归代替循环）]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127603386</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127603386</guid><author>chengchencheng</author><pubDate>Sun, 30 Oct 2022 19:16:49 +0800</pubDate><description><![CDATA[不能用循环，可以使用递归。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 63. 股票的最大利润】]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127603285</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127603285</guid><author>chengchencheng</author><pubDate>Sun, 30 Oct 2022 19:15:18 +0800</pubDate><description><![CDATA[双重循环，向前查找如果有利润大于当前最大利润的，记录下来。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 62. 圆圈中最后剩下的数字】（递归）]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127600716</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127600716</guid><author>chengchencheng</author><pubDate>Sun, 30 Oct 2022 18:54:19 +0800</pubDate><description><![CDATA[暴力法，超出时间限制。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 61. 扑克牌中的顺子】]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127600110</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127600110</guid><author>chengchencheng</author><pubDate>Sun, 30 Oct 2022 15:26:42 +0800</pubDate><description><![CDATA[先对数组进行排序，计算0的个数为cnt0。从非0数开始计算，如果有两个相邻的数相等，必然不能构成顺子；如果相邻的两个数相差不为1，累加缺少的排的数量diffe。如果diffe为0，意味着不缺少排，或者cnt0>diffe，即0牌的数大于缺少的数量，则返回TRUE。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 60. n个骰子的点数】（深搜 / 动态规划）]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127559183</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127559183</guid><author>chengchencheng</author><pubDate>Sun, 30 Oct 2022 11:14:00 +0800</pubDate><description><![CDATA[首先想到用深搜穷举所有可能的组合，然后计算每个点数出现的概率。（我好喜欢用深搜，然而好几次深搜只能通过部分测试样例，要快速排序才能完全解决问题）]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 59 - I. 滑动窗口的最大值】（优先队列）]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127539847</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127539847</guid><author>chengchencheng</author><pubDate>Wed, 26 Oct 2022 20:41:00 +0800</pubDate><description><![CDATA[暴力法，超出时间限制。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 58 - II. 左旋转字符串】（substring截取字符串）]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127523315</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127523315</guid><author>chengchencheng</author><pubDate>Tue, 25 Oct 2022 22:33:28 +0800</pubDate><description><![CDATA[分别截取0-k, k-len的字符串，并重新组合。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 58 - I. 翻转单词顺序】（split字符串分割）]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127521796</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127521796</guid><author>chengchencheng</author><pubDate>Tue, 25 Oct 2022 21:03:10 +0800</pubDate><description><![CDATA[对字符串按照“ ”进行分割，并将分割得到的数组倒序输出返回。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 57 - II. 和为s的连续正数序列】（list转int[]）]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127519254</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127519254</guid><author>chengchencheng</author><pubDate>Tue, 25 Oct 2022 18:52:38 +0800</pubDate><description><![CDATA[设置两个指针i,j < target，如果i,j之间的数字之和等于target则加入该数据。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 57. 和为s的两个数字】]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127461630</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127461630</guid><author>chengchencheng</author><pubDate>Sat, 22 Oct 2022 14:33:27 +0800</pubDate><description><![CDATA[设置两个指针i,j，分别指向数组左右两端，如果nums[i] + nums[j] > target，j指针向左移动；反之i指针向右移动，直到 nums[i] + nums[j] = target。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 56 - II. 数组中数字出现的次数 II】]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127461222</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127461222</guid><author>chengchencheng</author><pubDate>Sat, 22 Oct 2022 14:02:46 +0800</pubDate><description><![CDATA[没有时间、空间复杂度的要求，那就用双重循环吧。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 56 - I. 数组中数字出现的次数】]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127460951</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127460951</guid><author>chengchencheng</author><pubDate>Sat, 22 Oct 2022 13:39:43 +0800</pubDate><description><![CDATA[将每个数字出现的次数统计在map中，将出现一次的数字返回。]]></description><category></category></item><item><title><![CDATA[【剑指 Offer 55 - II. 平衡二叉树】]]></title><link>https://blog.youkuaiyun.com/chengchencheng/article/details/127460367</link><guid>https://blog.youkuaiyun.com/chengchencheng/article/details/127460367</guid><author>chengchencheng</author><pubDate>Sat, 22 Oct 2022 12:38:23 +0800</pubDate><description><![CDATA[一个节点的左右节点都是平衡二叉树，且左右节点的深度差不大于1，这个节点开始的树即为平衡二叉树。如果一个二叉树的每个节点开始的树都是平衡二叉树，这棵树就是平衡二叉树。]]></description><category></category></item></channel></rss>