<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[大树先生的博客]]></title><description><![CDATA[生活是一棵长满可能的树]]></description><link>https://blog.youkuaiyun.com/Koala_Tree</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Koala_Tree]]></copyright><item><title><![CDATA[LeetCode-24：Swap Nodes in Pairs(两两交换链表中的节点) -- Medium]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/81476772</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/81476772</guid><author>Koala_Tree</author><pubDate>Tue, 07 Aug 2018 10:33:27 +0800</pubDate><description><![CDATA[给定一个链表，两两交换其中相邻的节点，并返回交换后的链表]]></description><category></category></item><item><title><![CDATA[LeetCode-32：Longest Valid Parentheses(最长有效括号) -- Hard]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/81385559</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/81385559</guid><author>Koala_Tree</author><pubDate>Fri, 03 Aug 2018 12:41:59 +0800</pubDate><description><![CDATA[给定一个只包含 '(' 和 ')' 的字符串，找出最长的包含有效括号的子串的长度。]]></description><category></category></item><item><title><![CDATA[LeetCode-20、22：Valid、Generate Parentheses(括号匹配、生成)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/81384247</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/81384247</guid><author>Koala_Tree</author><pubDate>Fri, 03 Aug 2018 11:19:20 +0800</pubDate><description><![CDATA[给定一个只包括 '('，')'，'{'，'}'，'['，']' 的字符串，判断字符串是否有效。
给出 n 代表生成括号的对数，请你写出一个函数，使其能够生成所有可能的并且有效的括号组合。]]></description><category></category></item><item><title><![CDATA[LeetCode-14：Longest Common Prefix(最长公共前缀)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/81352851</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/81352851</guid><author>Koala_Tree</author><pubDate>Thu, 02 Aug 2018 09:41:44 +0800</pubDate><description><![CDATA[题目：

Write a function to find the longest common prefix string amongst an array of strings.



例子:

Example 1:



Input: [&quot;flower&quot;,&quot;flow&quot;,&quot;flight&quot;]
Output: &quot;fl&quot;

Example 2:



Input: [&quot;dog&quot;,&quot;racecar&qu]]></description><category></category></item><item><title><![CDATA[LeetCode-12：Integer to Roman(整数转罗马数字)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/81281176</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/81281176</guid><author>Koala_Tree</author><pubDate>Mon, 30 Jul 2018 10:47:30 +0800</pubDate><description><![CDATA[给定一个整数，将其转为罗马数字。]]></description><category></category></item><item><title><![CDATA[LeetCode-8：String to Integer (atoi)(字符串转整数) -- Medium]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/81233047</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/81233047</guid><author>Koala_Tree</author><pubDate>Fri, 27 Jul 2018 10:36:22 +0800</pubDate><description><![CDATA[将字符串转为整数]]></description><category></category></item><item><title><![CDATA[LeetCode-7：Reverse Integer(翻转整数)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/81210424</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/81210424</guid><author>Koala_Tree</author><pubDate>Wed, 25 Jul 2018 21:14:32 +0800</pubDate><description><![CDATA[给定一个 32 位有符号整数，将整数中的数字进行反转。]]></description><category></category></item><item><title><![CDATA[LeetCode-6：ZigZag Conversion(Z字形变换)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/81196921</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/81196921</guid><author>Koala_Tree</author><pubDate>Wed, 25 Jul 2018 10:02:20 +0800</pubDate><description><![CDATA[将字符串s以Z字形排列成给定的行数之后从左往右，逐行读取字符。]]></description><category></category></item><item><title><![CDATA[LeetCode-5：Longest Palindromic Substring (最长回文字串)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/81179289</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/81179289</guid><author>Koala_Tree</author><pubDate>Tue, 24 Jul 2018 10:00:43 +0800</pubDate><description><![CDATA[给定一个字符串 s，找到 s 中最长的回文子串]]></description><category></category></item><item><title><![CDATA[LeetCode-347：Top K Frequent Elements (前K个频率最高的元素)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/80393689</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/80393689</guid><author>Koala_Tree</author><pubDate>Mon, 21 May 2018 16:14:01 +0800</pubDate><description><![CDATA[给定一个非空的整数数组，返回前K个频率最高的元素]]></description><category></category></item><item><title><![CDATA[LeetCode-382：Linked List Random Node (随机返回链表结点)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/80339379</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/80339379</guid><author>Koala_Tree</author><pubDate>Wed, 16 May 2018 16:50:07 +0800</pubDate><description><![CDATA[设计一个类，该类能够实现随机返回链表中的一个结点。蓄水池算法]]></description><category></category></item><item><title><![CDATA[LeetCode-146：LRU Cache (最近使用缓存)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/80326015</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/80326015</guid><author>Koala_Tree</author><pubDate>Tue, 15 May 2018 17:28:46 +0800</pubDate><description><![CDATA[设计一个最近使用缓存的结构，使得该缓存具有get和put操作，并且，缓存有容量（capacity）上限。]]></description><category></category></item><item><title><![CDATA[LeetCode-4：Median of Two Sorted Arrays (两个排序数组的中位数)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/80243099</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/80243099</guid><author>Koala_Tree</author><pubDate>Tue, 08 May 2018 17:31:56 +0800</pubDate><description><![CDATA[给定两个排序的数组，给出两个数组的中位数。]]></description><category></category></item><item><title><![CDATA[LeetCode-397：Integer Replacement (整数变1的步骤)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/80236297</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/80236297</guid><author>Koala_Tree</author><pubDate>Tue, 08 May 2018 10:51:41 +0800</pubDate><description><![CDATA[给定整数n，将整数逐步替换为1. 若为偶数则以n/2替换，若为奇数则可以以n+1或者n-1替换。求最小的替换步骤。]]></description><category></category></item><item><title><![CDATA[LeetCode-137：Single Number II (只出现一次的数字)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/80228525</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/80228525</guid><author>Koala_Tree</author><pubDate>Mon, 07 May 2018 17:14:29 +0800</pubDate><description><![CDATA[给定一个非空整数数组，除了其中一个元素外，其余每个元素均出现三次。找出这个只出现一次的元素。]]></description><category></category></item><item><title><![CDATA[LeetCode-25：Reverse Nodes in k-Group (以k大小的组翻转链表)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/80226046</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/80226046</guid><author>Koala_Tree</author><pubDate>Mon, 07 May 2018 15:06:43 +0800</pubDate><description><![CDATA[给定单向链表，以k个节点作为一组进行链表的翻转。]]></description><category></category></item><item><title><![CDATA[LeetCode-57：Insert Interval (插入间隔)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/80109283</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/80109283</guid><author>Koala_Tree</author><pubDate>Fri, 27 Apr 2018 15:56:27 +0800</pubDate><description><![CDATA[给定间隔数组，和需要插入的间隔，将间隔插入到数组中，返回新数组]]></description><category></category></item><item><title><![CDATA[LeetCode-124：Binary Tree Maximum Path Sum (二叉树最大路径和)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/80109258</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/80109258</guid><author>Koala_Tree</author><pubDate>Fri, 27 Apr 2018 15:55:04 +0800</pubDate><description><![CDATA[给二叉树，寻找二叉树中从一个节点到任意一个节点的路径和的最大值]]></description><category></category></item><item><title><![CDATA[LeetCode-18：4 Sum (四数的和)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/80104382</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/80104382</guid><author>Koala_Tree</author><pubDate>Fri, 27 Apr 2018 10:30:56 +0800</pubDate><description><![CDATA[给定数组，返回数组中和为target的四元组]]></description><category></category></item><item><title><![CDATA[LeetCode-15、16：3Sum  & 3Sum Closest(三数的和)]]></title><link>https://blog.youkuaiyun.com/Koala_Tree/article/details/80092403</link><guid>https://blog.youkuaiyun.com/Koala_Tree/article/details/80092403</guid><author>Koala_Tree</author><pubDate>Thu, 26 Apr 2018 13:00:36 +0800</pubDate><description><![CDATA[给定数组，返回数组中和为0的三元组
给定数组及目标值，返回数组中和与目标值最接近的三元组]]></description><category></category></item></channel></rss>