<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[hyperbolechi的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/hyperbolechi</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hyperbolechi]]></copyright><item><title><![CDATA[45. Jump Game II leetcode python 2016 new season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50579397</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50579397</guid><author>hyperbolechi</author><pubDate>Mon, 25 Jan 2016 13:14:07 +0800</pubDate><description><![CDATA[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.
Your goal is to]]></description><category></category></item><item><title><![CDATA[44. Wildcard Matching leetcode Python 2016 new season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50577195</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50577195</guid><author>hyperbolechi</author><pubDate>Mon, 25 Jan 2016 07:09:19 +0800</pubDate><description><![CDATA[Implement wildcard pattern matching with support for '?' and '*'.
'?' Matches any single character.
'*' Matches any sequence of characters (including the empty sequence).

The matching should cover t]]></description><category></category></item><item><title><![CDATA[43. Multiply Strings leetcode python 2016 new season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50577175</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50577175</guid><author>hyperbolechi</author><pubDate>Mon, 25 Jan 2016 04:46:28 +0800</pubDate><description><![CDATA[Total Accepted: 51879 Total
 Submissions: 231091 Difficulty: Medium




Given two numbers represented as strings, return multiplication of the numbers as a string.
Note: The numbers can be arbi]]></description><category></category></item><item><title><![CDATA[42. Trapping Rain Water leetcode Python 2016 new season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50573608</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50573608</guid><author>hyperbolechi</author><pubDate>Sun, 24 Jan 2016 14:01:23 +0800</pubDate><description><![CDATA[Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
For example, 
Given [0,1,0,2,1,0,1,3,2,1,2,1], ]]></description><category></category></item><item><title><![CDATA[40. Combination Sum II leetcode Python 2016 new season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50573007</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50573007</guid><author>hyperbolechi</author><pubDate>Sun, 24 Jan 2016 10:58:45 +0800</pubDate><description><![CDATA[Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where
 the candidate numbers sums to T.

Each number in C may only be used once in the combina]]></description><category></category></item><item><title><![CDATA[39. Combination Sum leetcode python 2016 new season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50569504</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50569504</guid><author>hyperbolechi</author><pubDate>Sat, 23 Jan 2016 13:48:33 +0800</pubDate><description><![CDATA[Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where
 the candidate numbers sums to T.

The same repeated number may be chosen from C unlimited numb]]></description><category></category></item><item><title><![CDATA[38. Count and Say leetcode python 2016 new season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50554476</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50554476</guid><author>hyperbolechi</author><pubDate>Thu, 21 Jan 2016 13:09:24 +0800</pubDate><description><![CDATA[The count-and-say sequence is the sequence of integers beginning as follows:
1, 11, 21, 1211, 111221, ...

1 is read off as "one
 1" or 11.
11 is read off as "two
 1s" or 21.
21 is read off as ]]></description><category></category></item><item><title><![CDATA[37. Sudoku Solver leetcode python new season 2016]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50547562</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50547562</guid><author>hyperbolechi</author><pubDate>Wed, 20 Jan 2016 11:50:00 +0800</pubDate><description><![CDATA[Write a program to solve a Sudoku puzzle by filling the empty cells.

Empty cells are indicated by the character '.'.

You may assume that there will be only one unique solution.




A sudoku]]></description><category></category></item><item><title><![CDATA[36. Valid Sudoku leetcode Python new season 2016]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50547339</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50547339</guid><author>hyperbolechi</author><pubDate>Wed, 20 Jan 2016 11:22:08 +0800</pubDate><description><![CDATA[Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.

The Sudoku board could be partially filled, where empty cells are filled with the character '.'.




A partially fille]]></description><category></category></item><item><title><![CDATA[35. Search Insert Position leetcode Python 2016 new season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50547130</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50547130</guid><author>hyperbolechi</author><pubDate>Wed, 20 Jan 2016 11:01:57 +0800</pubDate><description><![CDATA[Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
]]></description><category></category></item><item><title><![CDATA[34. Search for a Range leetcode Python 2016 new season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50547008</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50547008</guid><author>hyperbolechi</author><pubDate>Wed, 20 Jan 2016 10:51:54 +0800</pubDate><description><![CDATA[Given a sorted array of integers, find the starting and ending position of a given target value.

Your algorithm's runtime complexity must be in the order of O(log n).

If the target is not found ]]></description><category></category></item><item><title><![CDATA[33. Search in Rotated Sorted Array leetcode python 2016 new season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50541725</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50541725</guid><author>hyperbolechi</author><pubDate>Tue, 19 Jan 2016 12:46:59 +0800</pubDate><description><![CDATA[Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4
 5 6 7 0 1 2).

You are given a target value to search. If found in the array retur]]></description><category></category></item><item><title><![CDATA[32. Longest Valid Parentheses leetcode python new season 2016]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50536560</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50536560</guid><author>hyperbolechi</author><pubDate>Mon, 18 Jan 2016 14:35:19 +0800</pubDate><description><![CDATA[Given a string containing just the characters '(' and ')',
 find the length of the longest valid (well-formed) parentheses substring.

For "(()", the longest valid parentheses substring is "()",
 ]]></description><category></category></item><item><title><![CDATA[31. Next Permutation leetcode Python 2016 new Season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50536451</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50536451</guid><author>hyperbolechi</author><pubDate>Mon, 18 Jan 2016 14:20:38 +0800</pubDate><description><![CDATA[Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.

If such arrangement is not possible, it must rearrange it as the lowest possible]]></description><category></category></item><item><title><![CDATA[30. Substring with Concatenation of All Words leetcode Python 2016 new season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50534429</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50534429</guid><author>hyperbolechi</author><pubDate>Mon, 18 Jan 2016 01:00:44 +0800</pubDate><description><![CDATA[You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation
 of each word in wordsexactly once and w]]></description><category></category></item><item><title><![CDATA[29. Divide Two Integers leetcode python new season 2016]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50503191</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50503191</guid><author>hyperbolechi</author><pubDate>Tue, 12 Jan 2016 12:14:40 +0800</pubDate><description><![CDATA[Divide two integers without using multiplication, division and mod operator.

If it is overflow, return MAX_INT.




class Solution(object):
    MAX_INT = 0x7FFFFFFF
    def divide(self, divide]]></description><category></category></item><item><title><![CDATA[28. Implement strStr() leetcode Python new season 2016]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50503036</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50503036</guid><author>hyperbolechi</author><pubDate>Tue, 12 Jan 2016 11:43:21 +0800</pubDate><description><![CDATA[Implement strStr().
Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.


Show Company Tags


Show Tags


Show Similar Problems



]]></description><category></category></item><item><title><![CDATA[27. Remove Element leetcode python 2016 new season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50502931</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50502931</guid><author>hyperbolechi</author><pubDate>Tue, 12 Jan 2016 11:32:54 +0800</pubDate><description><![CDATA[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 the new length.

t]]></description><category></category></item><item><title><![CDATA[25. Reverse Nodes in k-Group leetcode Python 2016 new season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50502741</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50502741</guid><author>hyperbolechi</author><pubDate>Tue, 12 Jan 2016 11:14:08 +0800</pubDate><description><![CDATA[Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.

If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is]]></description><category></category></item><item><title><![CDATA[24. Swap Nodes in Pairs leetcode Python 2016 new Season]]></title><link>https://blog.youkuaiyun.com/hyperbolechi/article/details/50491672</link><guid>https://blog.youkuaiyun.com/hyperbolechi/article/details/50491672</guid><author>hyperbolechi</author><pubDate>Sun, 10 Jan 2016 12:07:50 +0800</pubDate><description><![CDATA[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 only constant space. You m]]></description><category></category></item></channel></rss>