<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[细语呢喃]]></title><description><![CDATA[www.hrwhisper.me 新blog]]></description><link>https://blog.youkuaiyun.com/murmured</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; murmured]]></copyright><item><title><![CDATA[leetcode Increasing Triplet Subsequence]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50674501</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50674501</guid><author>murmured</author><pubDate>Tue, 16 Feb 2016 14:20:05 +0800</pubDate><description><![CDATA[leetcode Increasing Triplet Subsequence

Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.

Formally the function should:

Return true if t]]></description><category></category></item><item><title><![CDATA[leetcode Reconstruct Itinerary]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50641289</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50641289</guid><author>murmured</author><pubDate>Sat, 06 Feb 2016 23:34:47 +0800</pubDate><description><![CDATA[leetcode Reconstruct Itinerary

Given a list of airline tickets represented by pairs of departure and arrival airports [from,
 to], reconstruct the itinerary in order. All of the tickets belong to ]]></description><category></category></item><item><title><![CDATA[leetcode Verify Preorder Serialization of a Binary Tree]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50625360</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50625360</guid><author>murmured</author><pubDate>Tue, 02 Feb 2016 18:54:55 +0800</pubDate><description><![CDATA[One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null node, we record using a sentinel value such as #.
    ]]></description><category></category></item><item><title><![CDATA[leetcode Patching Array]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50596403</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50596403</guid><author>murmured</author><pubDate>Wed, 27 Jan 2016 20:07:29 +0800</pubDate><description><![CDATA[题意：给定一个数组nums和一个数n，求添加最少的数使得[1,n]中的每个数都可以由数组中元素和组成用known_sum表示已知的连续和为[1,known_sum)，有了这个表示那就简单了：




nums[i] 

nums[i] >  known_sum,  添加known_sum进数组才能达到最大的范围，所以已知范围更新为：[1,known_sum *2  )



]]></description><category></category></item><item><title><![CDATA[leetcode Longest Increasing Path in a Matrix]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50550302</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50550302</guid><author>murmured</author><pubDate>Wed, 20 Jan 2016 18:34:35 +0800</pubDate><description><![CDATA[题意：给定一个矩阵，在里面找出最大上升路径
int dx[] = { 1 , -1, 0 , 0  };
int dy[] = { 0 , 0 , 1 , -1 };
class Solution {
public:
	int dfs(int x, int y, const int &m,const int &n,vector>& matrix, vector>& dis) {
		if (di]]></description><category></category></item><item><title><![CDATA[leetcode Odd Even Linked List]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50527773</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50527773</guid><author>murmured</author><pubDate>Sat, 16 Jan 2016 13:09:36 +0800</pubDate><description><![CDATA[Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.

You should try to do it in]]></description><category></category></item><item><title><![CDATA[leetcode Count of Range Sum]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50495085</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50495085</guid><author>murmured</author><pubDate>Mon, 11 Jan 2016 09:48:25 +0800</pubDate><description><![CDATA[Given an integer array nums, return the number of range sums that lie in [lower,
 upper] inclusive.
Range sum S(i, j) is defined as the sum of the elements in nums between
 indices i and j (i ≤ j),]]></description><category></category></item><item><title><![CDATA[leetcode Power of Three]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50482594</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50482594</guid><author>murmured</author><pubDate>Fri, 08 Jan 2016 14:20:22 +0800</pubDate><description><![CDATA[Given an integer, write a function to determine if it is a power of three.

Follow up:
Could you do it without using any loop / recursion?



方法一：
class Solution {
public:
    bool isPowerOfTh]]></description><category></category></item><item><title><![CDATA[leetcode Wiggle Sort II]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50444578</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50444578</guid><author>murmured</author><pubDate>Fri, 01 Jan 2016 11:23:43 +0800</pubDate><description><![CDATA[Given an unsorted array nums, reorder it such that nums[0]
  nums[2] .

Example:
(1) Given nums = [1, 5, 1, 1, 6, 4], one possible answer is [1,
 4, 1, 5, 1, 6]. 
(2) Given nums = [1, 3, 2, 2, 3]]></description><category></category></item><item><title><![CDATA[leetcode Coin Change]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50411802</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50411802</guid><author>murmured</author><pubDate>Sun, 27 Dec 2015 11:46:03 +0800</pubDate><description><![CDATA[You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money]]></description><category></category></item><item><title><![CDATA[leetcode Create Maximum Number]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50392234</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50392234</guid><author>murmured</author><pubDate>Thu, 24 Dec 2015 09:43:13 +0800</pubDate><description><![CDATA[Given two arrays of length m and n with
 digits 0-9 representing two numbers. Create the maximum number of length k
  from digits of the two. The relative order of the digits from the same array mus]]></description><category></category></item><item><title><![CDATA[leetcode Bulb Switcher]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50363720</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50363720</guid><author>murmured</author><pubDate>Sun, 20 Dec 2015 12:44:36 +0800</pubDate><description><![CDATA[leetcode Bulb Switcher 题解
http://www.hrwhisper.me/leetcode-bulb-switcher/]]></description><category></category></item><item><title><![CDATA[leetcode Maximum Product of Word Lengths]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50323527</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50323527</guid><author>murmured</author><pubDate>Wed, 16 Dec 2015 09:28:16 +0800</pubDate><description><![CDATA[Given a string array words, find the maximum value of length(word[i])
 * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case le]]></description><category></category></item><item><title><![CDATA[leetcode Remove Duplicate Letters]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50241561</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50241561</guid><author>murmured</author><pubDate>Wed, 09 Dec 2015 21:12:36 +0800</pubDate><description><![CDATA[Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sure your result is the smallest in lexicographical order a]]></description><category></category></item><item><title><![CDATA[leetcode Count of Smaller Numbers After Self]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50201147</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50201147</guid><author>murmured</author><pubDate>Mon, 07 Dec 2015 07:32:15 +0800</pubDate><description><![CDATA[You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is
 the number of smaller elements to the right of nums[i].

Example]]></description><category></category></item><item><title><![CDATA[leetcode Super Ugly Number]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50159255</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50159255</guid><author>murmured</author><pubDate>Thu, 03 Dec 2015 13:06:41 +0800</pubDate><description><![CDATA[Write a program to find the nth super ugly number.

Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes of
 size k. For example, [1,
 2, 4, 7, 8, 13,]]></description><category></category></item><item><title><![CDATA[leetcode Burst Balloons]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50112387</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50112387</guid><author>murmured</author><pubDate>Mon, 30 Nov 2015 14:52:41 +0800</pubDate><description><![CDATA[Given n balloons,
 indexed from 0 to n-1.
 Each balloon is painted with a number on it represented by array nums.
 You are asked to burst all the balloons. If the you burst balloon i you
 will get]]></description><category></category></item><item><title><![CDATA[leetcode Best Time to Buy and Sell Stock with Cooldown]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50073521</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50073521</guid><author>murmured</author><pubDate>Fri, 27 Nov 2015 18:17:11 +0800</pubDate><description><![CDATA[Say you have an array for which the ith element
 is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy]]></description><category></category></item><item><title><![CDATA[leetcode Minimum Height Trees]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/50060905</link><guid>https://blog.youkuaiyun.com/murmured/article/details/50060905</guid><author>murmured</author><pubDate>Thu, 26 Nov 2015 20:49:10 +0800</pubDate><description><![CDATA[For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called mini]]></description><category></category></item><item><title><![CDATA[推广一下新Blog www.hrwhisper.me]]></title><link>https://blog.youkuaiyun.com/murmured/article/details/49846859</link><guid>https://blog.youkuaiyun.com/murmured/article/details/49846859</guid><author>murmured</author><pubDate>Sun, 15 Nov 2015 08:10:57 +0800</pubDate><description><![CDATA[新博客地址：www.hrwhisper.me]]></description><category></category></item></channel></rss>