<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[xiaohuihui52309的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/xiaohuihui52309</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; xiaohuihui52309]]></copyright><item><title><![CDATA[Restore IP Addresses]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72810634</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72810634</guid><author>xiaohuihui52309</author><pubDate>Tue, 30 May 2017 17:09:17 +0800</pubDate><description><![CDATA[Restore IP Addresses


Given a string containing only digits, restore it by returning all possible valid IP address combinations.

For example:
Given "25525511135",

return ["255.255.11.135", ]]></description><category></category></item><item><title><![CDATA[Clone Graph]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72641631</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72641631</guid><author>xiaohuihui52309</author><pubDate>Tue, 23 May 2017 15:35:15 +0800</pubDate><description><![CDATA[Clone Graph


Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.


OJ's undirected graph serialization:
Nodes are labeled uniquely.
We use # as a s]]></description><category></category></item><item><title><![CDATA[Gas Station]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72639773</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72639773</guid><author>xiaohuihui52309</author><pubDate>Tue, 23 May 2017 14:53:50 +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 fro]]></description><category></category></item><item><title><![CDATA[Lowest Common Ancestor of a Binary Tree]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72519097</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72519097</guid><author>xiaohuihui52309</author><pubDate>Fri, 19 May 2017 10:32:50 +0800</pubDate><description><![CDATA[Lowest Common Ancestor of a Binary Tree


Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

According to the definition of LCA on Wikipedia: “The lowest ]]></description><category></category></item><item><title><![CDATA[Remove Duplicates from Sorted List II]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72518435</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72518435</guid><author>xiaohuihui52309</author><pubDate>Fri, 19 May 2017 10:07:32 +0800</pubDate><description><![CDATA[Remove Duplicates from Sorted List II


Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

For example,
Given 1->2->]]></description><category></category></item><item><title><![CDATA[Reverse Linked List II]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72518040</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72518040</guid><author>xiaohuihui52309</author><pubDate>Fri, 19 May 2017 09:40:39 +0800</pubDate><description><![CDATA[Reverse Linked List II


Reverse a linked list from position m to n. Do it in-place and in one-pass.

For example:
Given 1->2->3->4->5->NULL, m = 2 and n = 4,

return 1->4->3->2->5->NULL.

N]]></description><category></category></item><item><title><![CDATA[Minimum Size Subarray Sum]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72353815</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72353815</guid><author>xiaohuihui52309</author><pubDate>Tue, 16 May 2017 22:12:20 +0800</pubDate><description><![CDATA[Minimum Size Subarray Sum


Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s.
 If there isn't one, return 0 ins]]></description><category></category></item><item><title><![CDATA[Merge Intervals]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72343634</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72343634</guid><author>xiaohuihui52309</author><pubDate>Tue, 16 May 2017 20:51:17 +0800</pubDate><description><![CDATA[Merge Intervals


Given a collection of intervals, merge all overlapping intervals.

For example,
Given [1,3],[2,6],[8,10],[15,18],
return [1,6],[8,10],[15,18].
解析：
排序再找区间
代码：
/**
 * Defini]]></description><category></category></item><item><title><![CDATA[Jump Game]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72332448</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72332448</guid><author>xiaohuihui52309</author><pubDate>Tue, 16 May 2017 20:37:05 +0800</pubDate><description><![CDATA[Jump Game


Given an array of non-negative integers, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.]]></description><category></category></item><item><title><![CDATA[Distinct Subsequences]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72315405</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72315405</guid><author>xiaohuihui52309</author><pubDate>Tue, 16 May 2017 19:44:09 +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 b]]></description><category></category></item><item><title><![CDATA[Search for a Range]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72294276</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72294276</guid><author>xiaohuihui52309</author><pubDate>Tue, 16 May 2017 15:50:01 +0800</pubDate><description><![CDATA[Search for a Range


Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.

Your algorithm's runtime complexity must be in the order]]></description><category></category></item><item><title><![CDATA[Course Schedule]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72287381</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72287381</guid><author>xiaohuihui52309</author><pubDate>Tue, 16 May 2017 15:24:55 +0800</pubDate><description><![CDATA[Course Schedule


There are a total of n courses you have to take, labeled from 0 to n
 - 1.

Some courses may have prerequisites, for example to take course 0 you have to first take course 1, w]]></description><category></category></item><item><title><![CDATA[Unique Substrings in Wraparound String]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72229526</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72229526</guid><author>xiaohuihui52309</author><pubDate>Mon, 15 May 2017 21:52:50 +0800</pubDate><description><![CDATA[Unique Substrings in Wraparound String



Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz",
 so s will look like this: "...zabcdefghijklmnopqrstuvwxyzabc]]></description><category></category></item><item><title><![CDATA[Construct Binary Tree from Preorder and Inorder Traversal]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72191048</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72191048</guid><author>xiaohuihui52309</author><pubDate>Mon, 15 May 2017 20:19:20 +0800</pubDate><description><![CDATA[Construct Binary Tree from Preorder and Inorder Traversal


Given preorder and inorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the t]]></description><category></category></item><item><title><![CDATA[Patching Array]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72190697</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72190697</guid><author>xiaohuihui52309</author><pubDate>Mon, 15 May 2017 20:03:56 +0800</pubDate><description><![CDATA[Patching Array


Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1,
 n]inclusive can be formed by the sum of some elemen]]></description><category></category></item><item><title><![CDATA[Russian Doll Envelopes]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72026992</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72026992</guid><author>xiaohuihui52309</author><pubDate>Sun, 14 May 2017 17:19:56 +0800</pubDate><description><![CDATA[Russian Doll Envelopes


You have a number of envelopes with widths and heights given as a pair of integers (w, h).
 One envelope can fit into another if and only if both the width and height of o]]></description><category></category></item><item><title><![CDATA[Frog Jump]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72026336</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72026336</guid><author>xiaohuihui52309</author><pubDate>Sun, 14 May 2017 16:37:26 +0800</pubDate><description><![CDATA[Frog Jump


A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.

]]></description><category></category></item><item><title><![CDATA[Construct Binary Tree from Inorder and Postorder Traversal]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72002915</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/72002915</guid><author>xiaohuihui52309</author><pubDate>Sun, 14 May 2017 15:47:32 +0800</pubDate><description><![CDATA[Construct Binary Tree from Inorder and Postorder Traversal


Given inorder and postorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the]]></description><category></category></item><item><title><![CDATA[Palindrome Partitioning]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/71987209</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/71987209</guid><author>xiaohuihui52309</author><pubDate>Sun, 14 May 2017 15:18:43 +0800</pubDate><description><![CDATA[Palindrome Partitioning


Given a string s, partition s such that every substring of the partition is a palindrome.

Return all possible palindrome partitioning of s.

For example, given s = "a]]></description><category></category></item><item><title><![CDATA[Permutations II]]></title><link>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/71977634</link><guid>https://blog.youkuaiyun.com/xiaohuihui52309/article/details/71977634</guid><author>xiaohuihui52309</author><pubDate>Sun, 14 May 2017 14:45:17 +0800</pubDate><description><![CDATA[Permutations II


Given a collection of numbers that might contain duplicates, return all possible unique permutations.

For example,
[1,1,2] have the following unique permutations:

[
  [1,1,]]></description><category></category></item></channel></rss>