<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[LintCode的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/LintCode</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; LintCode]]></copyright><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷分治法：合并两棵二叉树]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/126128052</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/126128052</guid><author>LintCode</author><pubDate>Tue, 02 Aug 2022 18:35:04 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷分治法：合并两棵二叉树]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：乱序字符串]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/126042867</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/126042867</guid><author>LintCode</author><pubDate>Fri, 29 Jul 2022 09:20:28 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：乱序字符串]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：文字并排]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/126042753</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/126042753</guid><author>LintCode</author><pubDate>Thu, 28 Jul 2022 20:05:33 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：文字并排]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：简化路径]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/126011768</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/126011768</guid><author>LintCode</author><pubDate>Wed, 27 Jul 2022 11:58:49 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：简化路径]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：神奇字符串]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125988702</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125988702</guid><author>LintCode</author><pubDate>Tue, 26 Jul 2022 10:09:02 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：神奇字符串]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：查找和替换模式]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125973159</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125973159</guid><author>LintCode</author><pubDate>Mon, 25 Jul 2022 14:14:15 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：查找和替换模式]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：旋转字符数组]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125929151</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125929151</guid><author>LintCode</author><pubDate>Fri, 22 Jul 2022 11:43:04 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：旋转字符数组]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：URL 编码]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125896084</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125896084</guid><author>LintCode</author><pubDate>Thu, 21 Jul 2022 09:10:00 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：URL 编码]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：空格替换]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125869071</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125869071</guid><author>LintCode</author><pubDate>Wed, 20 Jul 2022 09:59:51 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：空格替换]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：独特的摩尔斯编码]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125868879</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125868879</guid><author>LintCode</author><pubDate>Tue, 19 Jul 2022 11:46:12 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷字符串：独特的摩尔斯编码]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷双指针：寻找重复的数]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125786123</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125786123</guid><author>LintCode</author><pubDate>Mon, 18 Jul 2022 14:32:26 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷双指针：寻找重复的数]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷双指针：神奇字符串]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125786041</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125786041</guid><author>LintCode</author><pubDate>Fri, 15 Jul 2022 10:08:11 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷双指针：神奇字符串]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷双指针：最小范围]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125785733</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125785733</guid><author>LintCode</author><pubDate>Thu, 14 Jul 2022 15:39:10 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷双指针：最小范围]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷双指针： 两数之和]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125785181</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125785181</guid><author>LintCode</author><pubDate>Thu, 14 Jul 2022 15:23:14 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷双指针： 两数之和]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷双指针：K个空的位置]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125721699</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125721699</guid><author>LintCode</author><pubDate>Mon, 11 Jul 2022 15:04:47 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷双指针：K个空的位置]]></description><category></category></item><item><title><![CDATA[LeetCode/LintCode 题解丨一周爆刷双指针：数组中的最长山脉]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125652675</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125652675</guid><author>LintCode</author><pubDate>Thu, 07 Jul 2022 10:17:24 +0800</pubDate><description><![CDATA[LeetCode/LintCode 题解丨一周爆刷双指针：数组中的最长山脉]]></description><category></category></item><item><title><![CDATA[2022年Apple春招真题：二叉树的层次遍历]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125488930</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125488930</guid><author>LintCode</author><pubDate>Wed, 29 Jun 2022 09:16:47 +0800</pubDate><description><![CDATA[2022年Apple春招真题：二叉树的层次遍历]]></description><category></category></item><item><title><![CDATA[2022年美团春招真题：字符串排序]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125488784</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125488784</guid><author>LintCode</author><pubDate>Tue, 28 Jun 2022 13:09:14 +0800</pubDate><description><![CDATA[2022年美团春招真题：字符串排序]]></description><category></category></item><item><title><![CDATA[2022年百度春招真题：最长上升子序列]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/125487554</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/125487554</guid><author>LintCode</author><pubDate>Mon, 27 Jun 2022 17:12:31 +0800</pubDate><description><![CDATA[2022年百度春招真题：最长上升子序列]]></description><category></category></item><item><title><![CDATA[2022年微软面试真题：最大子数组]]></title><link>https://blog.youkuaiyun.com/LintCode/article/details/124664501</link><guid>https://blog.youkuaiyun.com/LintCode/article/details/124664501</guid><author>LintCode</author><pubDate>Mon, 09 May 2022 14:02:00 +0800</pubDate><description><![CDATA[描述：
给定一个整数数组，找到一个具有最大和的子数组，返回其最大和。
每个子数组的数字在数组中的位置应该是连续的。
样例 1：
输入：
nums = [−2,2,−3,4,−1,2,1,−5,3]
输出：
6
解释：
符合要求的子数组为[4,−1,2,1]，其最大和为 6。
样例 2：
输入：
nums = [1,2,3,4]
输出：
10
解释：
符合要求的子数组为[1,2,3,4]，其最大和为 10。
挑战
要求时间复杂度为O(n)

...]]></description><category></category></item></channel></rss>