<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[u012158672的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u012158672</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u012158672]]></copyright><item><title><![CDATA[Distinct Subsequences]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39402335</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39402335</guid><author>u012158672</author><pubDate>Fri, 19 Sep 2014 20:02:50 +0800</pubDate><description><![CDATA[Distinct Subsequences


Given a string S and a string T, count the number of distinct subsequences of
T in S.
A subsequence of a string is a new string which is formed from the original string by]]></description><category></category></item><item><title><![CDATA[Scramble String]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39402021</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39402021</guid><author>u012158672</author><pubDate>Fri, 19 Sep 2014 19:22:05 +0800</pubDate><description><![CDATA[Scramble String


Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.
Below is one possible representation of s1 = "great":
    gre]]></description><category></category></item><item><title><![CDATA[Populating Next Right Pointers in Each Node]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39369719</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39369719</guid><author>u012158672</author><pubDate>Thu, 18 Sep 2014 11:28:00 +0800</pubDate><description><![CDATA[Given a binary tree
    struct TreeLinkNode {
      TreeLinkNode *left;
      TreeLinkNode *right;
      TreeLinkNode *next;
    }

Populate each next pointer to point to its next right node. If the]]></description><category></category></item><item><title><![CDATA[Longest Consecutive Sequence]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39369611</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39369611</guid><author>u012158672</author><pubDate>Thu, 18 Sep 2014 11:21:42 +0800</pubDate><description><![CDATA[Longest Consecutive Sequence


Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
For example,
Given [100, 4, 200, 1, 3, 2],
The longest consecuti]]></description><category></category></item><item><title><![CDATA[Maximum Subarray]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39369433</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39369433</guid><author>u012158672</author><pubDate>Thu, 18 Sep 2014 11:11:21 +0800</pubDate><description><![CDATA[Maximum Subarray


Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [−2,1,−3,4,−1,2,1,−5,4],
the contiguous su]]></description><category></category></item><item><title><![CDATA[Gas Station]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39368893</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39368893</guid><author>u012158672</author><pubDate>Thu, 18 Sep 2014 10:37:37 +0800</pubDate><description><![CDATA[Gas Station


There are N gas stations along a circular route, where the amount of gas at station
i is gas[i].
You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from]]></description><category></category></item><item><title><![CDATA[Palindrome Number]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39368709</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39368709</guid><author>u012158672</author><pubDate>Thu, 18 Sep 2014 10:29:43 +0800</pubDate><description><![CDATA[Palindrome Number


Determine whether an integer is a palindrome. Do this without extra space.
click to show spoilers.
Some hints:
Could negative integers be palindromes? (ie, -1)
If you are th]]></description><category></category></item><item><title><![CDATA[Reverse Integer]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39368547</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39368547</guid><author>u012158672</author><pubDate>Thu, 18 Sep 2014 10:17:41 +0800</pubDate><description><![CDATA[Reverse Integer


Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
click to show spoilers.
Have you thought about this?
Here are some good questions ]]></description><category></category></item><item><title><![CDATA[Letter Combinations of a Phone Number]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39337497</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39337497</guid><author>u012158672</author><pubDate>Wed, 17 Sep 2014 08:57:37 +0800</pubDate><description><![CDATA[Letter Combinations of a Phone Number


Given a digit string, return all possible letter combinations that the number could represent.
A mapping of digit to letters (just like on the telephone but]]></description><category></category></item><item><title><![CDATA[Swap Nodes in Pairs]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39337441</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39337441</guid><author>u012158672</author><pubDate>Wed, 17 Sep 2014 08:49:38 +0800</pubDate><description><![CDATA[Swap Nodes in Pairs


Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.
Your algorithm should use o]]></description><category></category></item><item><title><![CDATA[LastNode of 完全二叉树]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39227485</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39227485</guid><author>u012158672</author><pubDate>Fri, 12 Sep 2014 11:15:54 +0800</pubDate><description><![CDATA[题目：求完全二叉树中，最后]]></description><category></category></item><item><title><![CDATA[Evaluate Reverse Polish Notation]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39206239</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39206239</guid><author>u012158672</author><pubDate>Thu, 11 Sep 2014 14:48:48 +0800</pubDate><description><![CDATA[Evaluate Reverse Polish Notation


Evaluate the value of an arithmetic expression in 
Reverse Polish Notation.
Valid operators are +, -, *, /. Each operand may be an integer or another expression]]></description><category></category></item><item><title><![CDATA[Reverse Words in a String]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39206097</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39206097</guid><author>u012158672</author><pubDate>Thu, 11 Sep 2014 14:38:38 +0800</pubDate><description><![CDATA[Reverse Words in a String
Total Accepted: 31611 
Total Submissions: 224230 

Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue",
return "blue is sk]]></description><category></category></item><item><title><![CDATA[Word Break]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39204031</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39204031</guid><author>u012158672</author><pubDate>Thu, 11 Sep 2014 11:09:18 +0800</pubDate><description><![CDATA[Word Break


Given a string s and a dictionary of words dict, determine if
s can be segmented into a space-separated sequence of one or more dictionary words.
For example, given
s = "leetcode",]]></description><category></category></item><item><title><![CDATA[Combinations]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39203925</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39203925</guid><author>u012158672</author><pubDate>Thu, 11 Sep 2014 11:00:46 +0800</pubDate><description><![CDATA[Combinations


Given two integers n and k, return all possible combinations of
k numbers out of 1 ... n.
For example,
If n = 4 and k = 2, a solution is:
[
  [2,4],
  [3,4],
  [2,3],
  [1,2],
  ]]></description><category></category></item><item><title><![CDATA[Remove Element]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39203833</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39203833</guid><author>u012158672</author><pubDate>Thu, 11 Sep 2014 10:56:02 +0800</pubDate><description><![CDATA[Remove Element


Given an array and a value, remove all instances of that value in place and return the new length.
The order of elements can be changed. It doesn't matter what you leave beyond th]]></description><category></category></item><item><title><![CDATA[Copy List with Random Pointer]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39203633</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39203633</guid><author>u012158672</author><pubDate>Thu, 11 Sep 2014 10:45:10 +0800</pubDate><description><![CDATA[Copy List with Random Pointer


A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.
Return a deep copy of the list.]]></description><category></category></item><item><title><![CDATA[Rotate List]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39203423</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39203423</guid><author>u012158672</author><pubDate>Thu, 11 Sep 2014 10:34:23 +0800</pubDate><description><![CDATA[Rotate List


Given a list, rotate the list to the right by k places, where k is non-negative.
For example:
Given 1->2->3->4->5->NULL and k = 2,
return 4->5->1->2->3->NULL.]]></description><category></category></item><item><title><![CDATA[各种List Sort]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39202609</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39202609</guid><author>u012158672</author><pubDate>Thu, 11 Sep 2014 09:50:45 +0800</pubDate><description><![CDATA[排序算法，]]></description><category></category></item><item><title><![CDATA[Add Binary]]></title><link>https://blog.youkuaiyun.com/u012158672/article/details/39156343</link><guid>https://blog.youkuaiyun.com/u012158672/article/details/39156343</guid><author>u012158672</author><pubDate>Tue, 09 Sep 2014 15:09:06 +0800</pubDate><description><![CDATA[Add Binary


Given two binary strings, return their sum (also a binary string).
For example,
a = "11"
b = "1"
Return "100".]]></description><category></category></item></channel></rss>