<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[intmain_Rocking的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/intmain_Rocking</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; intmain_Rocking]]></copyright><item><title><![CDATA[Spring 源码编译 出错FAILURE: Build failed with an exception.]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/44034785</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/44034785</guid><author>intmain_Rocking</author><pubDate>Tue, 03 Mar 2015 10:17:06 +0800</pubDate><description><![CDATA[编译过程中出现如下错误

 



FAILURE: Build failed with an exception.

 

* What went wrong:

Execution failed for task ':referencePdf'.

> Java heap space

 

* Try:

Run with --stacktrace o]]></description><category></category></item><item><title><![CDATA[[leetcode] Symmetric Tree]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43524981</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43524981</guid><author>intmain_Rocking</author><pubDate>Thu, 05 Feb 2015 10:48:18 +0800</pubDate><description><![CDATA[Symmetric Tree
 Total Accepted: 43063 Total
 Submissions: 137255My Submissions

Question
 Solution 





Given a binary tree, check whether it is a mirror of itself (ie, symmetric around it]]></description><category></category></item><item><title><![CDATA[[leetcode] Same Tree]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43524949</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43524949</guid><author>intmain_Rocking</author><pubDate>Thu, 05 Feb 2015 10:46:57 +0800</pubDate><description><![CDATA[Same Tree
 Total Accepted: 46766 Total
 Submissions: 111239My Submissions

Question
 Solution 





Given two binary trees, write a function to check if they are equal or not.
Two binary t]]></description><category></category></item><item><title><![CDATA[[leetcode] Remove Duplicates from Sorted List]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43524329</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43524329</guid><author>intmain_Rocking</author><pubDate>Thu, 05 Feb 2015 10:13:06 +0800</pubDate><description><![CDATA[Remove Duplicates from Sorted List
 Total Accepted: 44414 Total
 Submissions: 129168My Submissions

Question
 Solution 





Given a sorted linked list, delete all duplicates such that each]]></description><category></category></item><item><title><![CDATA[[leetcode] Subsets]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43524305</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43524305</guid><author>intmain_Rocking</author><pubDate>Thu, 05 Feb 2015 10:11:28 +0800</pubDate><description><![CDATA[Subsets
 Total Accepted: 37337 Total
 Submissions: 132727My Submissions

Question
 Solution 





Given a set of distinct integers, S, return all possible subsets.
Note:


Elements in a]]></description><category></category></item><item><title><![CDATA[[leetcode] Plus One]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43524273</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43524273</guid><author>intmain_Rocking</author><pubDate>Thu, 05 Feb 2015 10:08:57 +0800</pubDate><description><![CDATA[Plus One
 Total Accepted: 34829 Total
 Submissions: 111864My Submissions

Question
 Solution 





Given a non-negative number represented as an array of digits, plus one to the number.
Th]]></description><category></category></item><item><title><![CDATA[[leetcode] Add Binary]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43483887</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43483887</guid><author>intmain_Rocking</author><pubDate>Wed, 04 Feb 2015 11:31:05 +0800</pubDate><description><![CDATA[Add Binary
 Total Accepted: 31178 Total
 Submissions: 124110My Submissions

Question
 Solution 





Given two binary strings, return their sum (also a binary string).
For example,
a = "1]]></description><category></category></item><item><title><![CDATA[[leetcode] Merge Two Sorted Lists]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43483851</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43483851</guid><author>intmain_Rocking</author><pubDate>Wed, 04 Feb 2015 11:28:54 +0800</pubDate><description><![CDATA[Merge Two Sorted Lists
 Total Accepted: 41990 Total
 Submissions: 126215My Submissions

Question
 Solution 





Merge two sorted linked lists and return it as a new list. The new list shou]]></description><category></category></item><item><title><![CDATA[[leetcode] Length of Last Word]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43371513</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43371513</guid><author>intmain_Rocking</author><pubDate>Sun, 01 Feb 2015 14:24:41 +0800</pubDate><description><![CDATA[Length of Last Word
 Total Accepted: 32811 Total
 Submissions: 113876My Submissions

Question
 Solution 





Given a string s consists of upper/lower-case alphabets and empty space charact]]></description><category></category></item><item><title><![CDATA[[leetcode] Jump Game]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43371501</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43371501</guid><author>intmain_Rocking</author><pubDate>Sun, 01 Feb 2015 14:22:50 +0800</pubDate><description><![CDATA[Jump Game
 Total Accepted: 32273 Total
 Submissions: 118742My Submissions

Question
 Solution 





Given an array of non-negative integers, you are initially positioned at the first index ]]></description><category></category></item><item><title><![CDATA[[leetcode] First Missing Positive]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43371493</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43371493</guid><author>intmain_Rocking</author><pubDate>Sun, 01 Feb 2015 14:21:15 +0800</pubDate><description><![CDATA[First Missing Positive
 Total Accepted: 27915 Total
 Submissions: 121776My Submissions

Question
 Solution 





Given an unsorted integer array, find the first missing positive integer.
F]]></description><category></category></item><item><title><![CDATA[[leetcode] Count and Say]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43371457</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43371457</guid><author>intmain_Rocking</author><pubDate>Sun, 01 Feb 2015 14:18:35 +0800</pubDate><description><![CDATA[Count and Say
 Total Accepted: 29451 Total
 Submissions: 114094My Submissions

Question
 Solution 





The count-and-say sequence is the sequence of integers beginning as follows:
1, 11, ]]></description><category></category></item><item><title><![CDATA[[leetcode] Valid Sudoku]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43371433</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43371433</guid><author>intmain_Rocking</author><pubDate>Sun, 01 Feb 2015 14:14:38 +0800</pubDate><description><![CDATA[Valid Sudoku
 Total Accepted: 24879 Total
 Submissions: 91590My Submissions

Question
 Solution 





Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.
The Sudoku b]]></description><category></category></item><item><title><![CDATA[[leetcode] Implement strStr()]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43274809</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43274809</guid><author>intmain_Rocking</author><pubDate>Thu, 29 Jan 2015 18:58:07 +0800</pubDate><description><![CDATA[Implement strStr()
 Total Accepted: 35824 Total
 Submissions: 163928My Submissions

Question
 Solution 





Implement strStr().
Returns the index of the first occurrence of needle in hays]]></description><category></category></item><item><title><![CDATA[[leetcode] Remove Element]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43274787</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43274787</guid><author>intmain_Rocking</author><pubDate>Thu, 29 Jan 2015 18:56:00 +0800</pubDate><description><![CDATA[Remove Element
 Total Accepted: 40769 Total
 Submissions: 125507My Submissions

Question
 Solution 





Given an array and a value, remove all instances of that value in place and return t]]></description><category></category></item><item><title><![CDATA[[leetcode] Remove Duplicates from Sorted Array]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43274769</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43274769</guid><author>intmain_Rocking</author><pubDate>Thu, 29 Jan 2015 18:54:28 +0800</pubDate><description><![CDATA[Remove Duplicates from Sorted Array
 Total Accepted: 43986 Total
 Submissions: 139040My Submissions

Question
 Solution 





Given a sorted array, remove the duplicates in place such that ]]></description><category></category></item><item><title><![CDATA[[leetcode] Swap Nodes in Pairs]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43274751</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43274751</guid><author>intmain_Rocking</author><pubDate>Thu, 29 Jan 2015 18:51:44 +0800</pubDate><description><![CDATA[Swap Nodes in Pairs
 Total Accepted: 35316 Total
 Submissions: 108528My Submissions

Question
 Solution 





Given a linked list, swap every two adjacent nodes and return its head.
For ex]]></description><category></category></item><item><title><![CDATA[[leetcode] Valid Parentheses]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43274057</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43274057</guid><author>intmain_Rocking</author><pubDate>Thu, 29 Jan 2015 17:38:53 +0800</pubDate><description><![CDATA[Valid Parentheses
 Total Accepted: 34774 Total
 Submissions: 127051My Submissions

Question
 Solution 





Given a string containing just the characters '(', ')', '{', '}', '[' and ']',
 ]]></description><category></category></item><item><title><![CDATA[[leetcode] Remove Nth Node From End of List]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43274031</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43274031</guid><author>intmain_Rocking</author><pubDate>Thu, 29 Jan 2015 17:37:48 +0800</pubDate><description><![CDATA[Remove Nth Node From End of List
 Total Accepted: 37015 Total
 Submissions: 130110My Submissions

Question
 Solution 





Given a linked list, remove the nth node from the end of list and ]]></description><category></category></item><item><title><![CDATA[[leetcode] Longest Common Prefix]]></title><link>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43273987</link><guid>https://blog.youkuaiyun.com/intmain_Rocking/article/details/43273987</guid><author>intmain_Rocking</author><pubDate>Thu, 29 Jan 2015 17:34:40 +0800</pubDate><description><![CDATA[Longest Common Prefix
 Total Accepted: 32695 Total
 Submissions: 123512My Submissions

Question
 Solution 





Write a function to find the longest common prefix string amongst an array of]]></description><category></category></item></channel></rss>