<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[hill_wind的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/hill_wind</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hill_wind]]></copyright><item><title><![CDATA[LeetCode::Reverse Linked List II]]></title><link>https://blog.youkuaiyun.com/hill_wind/article/details/40406325</link><guid>https://blog.youkuaiyun.com/hill_wind/article/details/40406325</guid><author>hill_wind</author><pubDate>Thu, 23 Oct 2014 22:28:09 +0800</pubDate><description><![CDATA[https://oj.leetcode.com/problems/reverse-linked-list-ii/]]></description><category></category></item><item><title><![CDATA[LeetCode::Remove Duplicates from Sorted Array]]></title><link>https://blog.youkuaiyun.com/hill_wind/article/details/40226575</link><guid>https://blog.youkuaiyun.com/hill_wind/article/details/40226575</guid><author>hill_wind</author><pubDate>Sat, 18 Oct 2014 22:41:54 +0800</pubDate><description><![CDATA[https://oj.leetcode.com/problems/remove-duplicates-from-sorted-array/]]></description><category></category></item><item><title><![CDATA[LeetCode::Merge Two Sorted Lists]]></title><link>https://blog.youkuaiyun.com/hill_wind/article/details/40222463</link><guid>https://blog.youkuaiyun.com/hill_wind/article/details/40222463</guid><author>hill_wind</author><pubDate>Sat, 18 Oct 2014 22:20:16 +0800</pubDate><description><![CDATA[https://oj.leetcode.com/problems/merge-two-sorted-lists/]]></description><category></category></item><item><title><![CDATA[LeetCode::Reorder List]]></title><link>https://blog.youkuaiyun.com/hill_wind/article/details/40199287</link><guid>https://blog.youkuaiyun.com/hill_wind/article/details/40199287</guid><author>hill_wind</author><pubDate>Sat, 18 Oct 2014 00:29:40 +0800</pubDate><description><![CDATA[https://oj.leetcode.com/problems/reorder-list/


Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…

You must do this in-place without altering the nodes' valu]]></description><category></category></item><item><title><![CDATA[LeetCode::Remove Duplicates from Sorted List II]]></title><link>https://blog.youkuaiyun.com/hill_wind/article/details/40159437</link><guid>https://blog.youkuaiyun.com/hill_wind/article/details/40159437</guid><author>hill_wind</author><pubDate>Thu, 16 Oct 2014 22:36:58 +0800</pubDate><description><![CDATA[https://oj.leetcode.com/problems/remove-duplicates-from-sorted-list-ii/]]></description><category></category></item><item><title><![CDATA[LeetCode::Remove Duplicates from Sorted List]]></title><link>https://blog.youkuaiyun.com/hill_wind/article/details/40159389</link><guid>https://blog.youkuaiyun.com/hill_wind/article/details/40159389</guid><author>hill_wind</author><pubDate>Thu, 16 Oct 2014 22:31:15 +0800</pubDate><description><![CDATA[https://oj.leetcode.com/problems/remove-duplicates-from-sorted-list/




Given a sorted linked list, delete all duplicates such that each element appear only once.

For example,
Given 1->1->2,]]></description><category></category></item><item><title><![CDATA[LeetCode::Spiral Matrix II]]></title><link>https://blog.youkuaiyun.com/hill_wind/article/details/40159337</link><guid>https://blog.youkuaiyun.com/hill_wind/article/details/40159337</guid><author>hill_wind</author><pubDate>Thu, 16 Oct 2014 22:29:56 +0800</pubDate><description><![CDATA[https://oj.leetcode.com/problems/spiral-matrix-ii/




Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.

For example,
Given n = 3,
You should re]]></description><category></category></item><item><title><![CDATA[LeetCode::Permutations II]]></title><link>https://blog.youkuaiyun.com/hill_wind/article/details/40159023</link><guid>https://blog.youkuaiyun.com/hill_wind/article/details/40159023</guid><author>hill_wind</author><pubDate>Thu, 16 Oct 2014 22:23:39 +0800</pubDate><description><![CDATA[https://oj.leetcode.com/problems/permutations-ii/


Given a collection of numbers that might contain duplicates, return all possible unique permutations.

For example,
[1,1,2] have the following]]></description><category></category></item><item><title><![CDATA[LeetCode::Add Binary]]></title><link>https://blog.youkuaiyun.com/hill_wind/article/details/40158847</link><guid>https://blog.youkuaiyun.com/hill_wind/article/details/40158847</guid><author>hill_wind</author><pubDate>Thu, 16 Oct 2014 22:22:56 +0800</pubDate><description><![CDATA[Given two binary strings, return their sum (also a binary string).

For example,
a = "11"
b = "1"
Return "100".]]></description><category></category></item><item><title><![CDATA[LeetCode::Permutations]]></title><link>https://blog.youkuaiyun.com/hill_wind/article/details/40158947</link><guid>https://blog.youkuaiyun.com/hill_wind/article/details/40158947</guid><author>hill_wind</author><pubDate>Thu, 16 Oct 2014 22:21:36 +0800</pubDate><description><![CDATA[Given a collection of numbers, return all possible permutations.

For example,
[1,2,3] have the following permutations:
[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2],
 and [3,2,1].]]></description><category></category></item><item><title><![CDATA[LeetCode::Wildcard Matching]]></title><link>https://blog.youkuaiyun.com/hill_wind/article/details/39855531</link><guid>https://blog.youkuaiyun.com/hill_wind/article/details/39855531</guid><author>hill_wind</author><pubDate>Tue, 07 Oct 2014 17:05:34 +0800</pubDate><description><![CDATA[https://oj.leetcode.com/problems/wildcard-matching/




Implement wildcard pattern matching with support for '?' and '*'.
'?' Matches any single character.
'*' Matches any sequence of characters]]></description><category></category></item><item><title><![CDATA[LeetCode::Decode Ways]]></title><link>https://blog.youkuaiyun.com/hill_wind/article/details/39850163</link><guid>https://blog.youkuaiyun.com/hill_wind/article/details/39850163</guid><author>hill_wind</author><pubDate>Tue, 07 Oct 2014 05:09:08 +0800</pubDate><description><![CDATA[A message containing letters from A-Z is being encoded to numbers using
 the following mapping:
'A' -> 1
'B' -> 2
...
'Z' -> 26


Given an encoded message containing digits, determine the total nu]]></description><category></category></item><item><title><![CDATA[LeetCode::Combinations]]></title><link>https://blog.youkuaiyun.com/hill_wind/article/details/39831185</link><guid>https://blog.youkuaiyun.com/hill_wind/article/details/39831185</guid><author>hill_wind</author><pubDate>Mon, 06 Oct 2014 20:09:35 +0800</pubDate><description><![CDATA[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],
  [1,3],
  [1,4],
]]]></description><category></category></item></channel></rss>