<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[HolyDominat的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/HolyDominat</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; HolyDominat]]></copyright><item><title><![CDATA[LeetCode-Maximum Product Subarray]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/39538751</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/39538751</guid><author>HolyDominat</author><pubDate>Thu, 25 Sep 2014 02:28:23 +0800</pubDate><description><![CDATA[Find the contiguous subarray within an array (containing at least one number) which has the largest product.

For example, given the array [2,3,-2,4],

the contiguous subarray [2,3] has the larges]]></description><category></category></item><item><title><![CDATA[LeetCode-Integer to Roman]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/39444249</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/39444249</guid><author>HolyDominat</author><pubDate>Sun, 21 Sep 2014 03:34:11 +0800</pubDate><description><![CDATA[Given an integer, convert it to a roman numeral.

Input is guaranteed to be within the range from 1 to 3999.
Solution:
Code:
class Solution {
public:
    string intToRoman(int num) {
        vect]]></description><category></category></item><item><title><![CDATA[LeetCode-Roman to Integer]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/39444087</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/39444087</guid><author>HolyDominat</author><pubDate>Sun, 21 Sep 2014 03:24:23 +0800</pubDate><description><![CDATA[Given a roman numeral, convert it to an integer.

Input is guaranteed to be within the range from 1 to 3999.
Solution:
Code:
class Solution {
public:
    int getRomanValue(char c) {  
        swi]]></description><category></category></item><item><title><![CDATA[LeetCode-Longest Palindromic Substring]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/39442623</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/39442623</guid><author>HolyDominat</author><pubDate>Sun, 21 Sep 2014 02:19:55 +0800</pubDate><description><![CDATA[Given a string S,
 find the longest palindromic substring in S.
 You may assume that the maximum length of S is
 1000, and there exists one unique longest palindromic substring.

Solution:
Code:]]></description><category></category></item><item><title><![CDATA[LeetCode-Two Sum]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38686347</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38686347</guid><author>HolyDominat</author><pubDate>Tue, 19 Aug 2014 18:54:55 +0800</pubDate><description><![CDATA[Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, whe]]></description><category></category></item><item><title><![CDATA[LeetCode-Median of Two Sorted Arrays]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38681831</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38681831</guid><author>HolyDominat</author><pubDate>Tue, 19 Aug 2014 14:55:39 +0800</pubDate><description><![CDATA[There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall
 run time complexity should be O(log (m+n)).
Solution:
Code:
class Solution ]]></description><category></category></item><item><title><![CDATA[LeetCode-Longest Substring Without Repeating Characters]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38680963</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38680963</guid><author>HolyDominat</author><pubDate>Tue, 19 Aug 2014 14:10:27 +0800</pubDate><description><![CDATA[Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without
 repeating letters for "abcabcbb" is "abc", which the length is 3. Fo]]></description><category></category></item><item><title><![CDATA[LeetCode-Add Two Numbers]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38680645</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38680645</guid><author>HolyDominat</author><pubDate>Tue, 19 Aug 2014 13:44:16 +0800</pubDate><description><![CDATA[You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link]]></description><category></category></item><item><title><![CDATA[LeetCode-ZigZag Conversion]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38680443</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38680443</guid><author>HolyDominat</author><pubDate>Tue, 19 Aug 2014 13:25:07 +0800</pubDate><description><![CDATA[The string "PAYPALISHIRING" is written in a zigzag pattern on a given
 number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
P   A   H   N
A P L S I ]]></description><category></category></item><item><title><![CDATA[LeetCode-Reverse Integer]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38666539</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38666539</guid><author>HolyDominat</author><pubDate>Mon, 18 Aug 2014 21:44:03 +0800</pubDate><description><![CDATA[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 to ask before c]]></description><category></category></item><item><title><![CDATA[LeetCode-String to Integer (atoi)]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38666431</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38666431</guid><author>HolyDominat</author><pubDate>Mon, 18 Aug 2014 21:31:39 +0800</pubDate><description><![CDATA[Implement atoi to convert a string to an integer.

Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input ca]]></description><category></category></item><item><title><![CDATA[LeetCode-Palindrome Number]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38666249</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38666249</guid><author>HolyDominat</author><pubDate>Mon, 18 Aug 2014 21:18:37 +0800</pubDate><description><![CDATA[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 thinking of convertin]]></description><category></category></item><item><title><![CDATA[LeetCode-Regular Expression Matching]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38665135</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38665135</guid><author>HolyDominat</author><pubDate>Mon, 18 Aug 2014 19:55:07 +0800</pubDate><description><![CDATA[Implement regular expression matching with support for '.' and '*'.
'.' Matches any single character.
'*' Matches zero or more of the preceding element.

The matching should cover the entire input st]]></description><category></category></item><item><title><![CDATA[LeetCode-Container With Most Water]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38660725</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38660725</guid><author>HolyDominat</author><pubDate>Mon, 18 Aug 2014 14:53:53 +0800</pubDate><description><![CDATA[Given n non-negative integers a1, a2,
 ..., an, where each represents a point at coordinate (i, ai). n vertical
 lines are drawn such that the two endpoints of line i is at (i, ai) and (i,
 0). Fin]]></description><category></category></item><item><title><![CDATA[LeetCode-Longest Common Prefix]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38660301</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38660301</guid><author>HolyDominat</author><pubDate>Mon, 18 Aug 2014 14:31:23 +0800</pubDate><description><![CDATA[Write a function to find the longest common prefix string amongst an array of strings.
Solution:
Code:]]></description><category></category></item><item><title><![CDATA[LeetCode-3Sum]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38660051</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38660051</guid><author>HolyDominat</author><pubDate>Mon, 18 Aug 2014 14:19:40 +0800</pubDate><description><![CDATA[Given an array S of n integers, are there elements a, b, c in S such that a + b + c =
 0? Find all unique triplets in the array which gives the sum of zero.

Note:


Elements in a triplet (a,b,c]]></description><category></category></item><item><title><![CDATA[LeetCode-3Sum Closest]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38659617</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38659617</guid><author>HolyDominat</author><pubDate>Mon, 18 Aug 2014 14:02:30 +0800</pubDate><description><![CDATA[Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have
 exact]]></description><category></category></item><item><title><![CDATA[LeetCode-4Sum]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38659257</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38659257</guid><author>HolyDominat</author><pubDate>Mon, 18 Aug 2014 13:45:03 +0800</pubDate><description><![CDATA[Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d =
 target? Find all unique quadruplets in the array which gives the sum of target.

Note:


Element]]></description><category></category></item><item><title><![CDATA[LeetCode-Letter Combinations of a Phone Number]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38657961</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38657961</guid><author>HolyDominat</author><pubDate>Mon, 18 Aug 2014 12:01:34 +0800</pubDate><description><![CDATA[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 buttons) is given below.


Input:Digit st]]></description><category></category></item><item><title><![CDATA[LeetCode-Remove Nth Node From End of List]]></title><link>https://blog.youkuaiyun.com/HolyDominat/article/details/38657725</link><guid>https://blog.youkuaiyun.com/HolyDominat/article/details/38657725</guid><author>HolyDominat</author><pubDate>Mon, 18 Aug 2014 11:41:31 +0800</pubDate><description><![CDATA[Given a linked list, remove the nth node from the end of list and return its head.

For example,
   Given linked list: 1->2->3->4->5, and n = 2.

   After removing the second node from the end, the]]></description><category></category></item></channel></rss>