<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[mattmu的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/mattmu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; mattmu]]></copyright><item><title><![CDATA[《算法概论》第八章NP完全问题部分习题解]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/74534228</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/74534228</guid><author>mattmu</author><pubDate>Thu, 06 Jul 2017 12:52:37 +0800</pubDate><description><![CDATA[8.10利用推广的方法证明NP-完全性。对以下每个问题，通过证明它是本章某个NP-完全问题的推广说明它是NP-完全的。]]></description><category></category></item><item><title><![CDATA[LeetCode【413】Arithmetic Slices]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/73526822</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/73526822</guid><author>mattmu</author><pubDate>Wed, 21 Jun 2017 09:25:58 +0800</pubDate><description><![CDATA[leetcode]]></description><category></category></item><item><title><![CDATA[LeetCode【576】 Out of Boundary Paths]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/73026805</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/73026805</guid><author>mattmu</author><pubDate>Sun, 11 Jun 2017 12:34:17 +0800</pubDate><description><![CDATA[There is an m by n grid with a ball. Given the start coordinate (i,j) of the ball, you can move the ball to adjacent cell or cross the grid boundary in four directions (up, down, left, right). However,]]></description><category></category></item><item><title><![CDATA[LeetCode【514】Freedom Trail]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/72863310</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/72863310</guid><author>mattmu</author><pubDate>Mon, 05 Jun 2017 00:38:56 +0800</pubDate><description><![CDATA[In the video game Fallout 4, the quest “Road to Freedom” requires players to reach a metal dial called the “Freedom Trail Ring”, and use the dial to spell a specific keyword in order to open the door.]]></description><category></category></item><item><title><![CDATA[LeetCode【472】 Concatenated Words]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/72812243</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/72812243</guid><author>mattmu</author><pubDate>Tue, 30 May 2017 22:15:28 +0800</pubDate><description><![CDATA[Given a list of words (without duplicates), please write a program that returns all concatenated words in the given list of words.  
  A concatenated word is defined as a string that is comprised entir]]></description><category></category></item><item><title><![CDATA[LeetCode【410】 Split Array Largest Sum]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/72615126</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/72615126</guid><author>mattmu</author><pubDate>Sun, 21 May 2017 22:11:26 +0800</pubDate><description><![CDATA[Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m suba]]></description><category></category></item><item><title><![CDATA[LeetCode[338]Counting Bits]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/72228929</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/72228929</guid><author>mattmu</author><pubDate>Mon, 15 May 2017 21:10:42 +0800</pubDate><description><![CDATA[Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.  
  Example:
  
  
    For]]></description><category></category></item><item><title><![CDATA[LeetCode[517] Super Washing Machines]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/71337169</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/71337169</guid><author>mattmu</author><pubDate>Sun, 07 May 2017 17:13:09 +0800</pubDate><description><![CDATA[You have n super washing machines on a line. Initially, each washing machine has some dresses or is empty.  
  For each move, you could choose any m (1 ≤ m ≤ n) washing machines, and pass one dress of]]></description><category></category></item><item><title><![CDATA[LeetCode Algorithm【547 】Friend Circles]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/71055393</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/71055393</guid><author>mattmu</author><pubDate>Mon, 01 May 2017 13:08:19 +0800</pubDate><description><![CDATA[LeetCode]]></description><category></category></item><item><title><![CDATA[LeetCode部分题解]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/70482640</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/70482640</guid><author>mattmu</author><pubDate>Sun, 23 Apr 2017 09:47:23 +0800</pubDate><description><![CDATA[LeetCode Algorithm部分.502【502】 IPO
  Suppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects to increase it]]></description><category></category></item><item><title><![CDATA[LeetCode部分题解]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/70207625</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/70207625</guid><author>mattmu</author><pubDate>Mon, 17 Apr 2017 09:29:36 +0800</pubDate><description><![CDATA[LeetCode Algorithm部分.399【399】 Evaluate Division
  Given a string s and a string t, check if s is subsequence of t.  
  You may assume that there is only lower case English letters in both s and t. t is]]></description><category></category></item><item><title><![CDATA[LeetCode部分题解]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/69939308</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/69939308</guid><author>mattmu</author><pubDate>Sun, 09 Apr 2017 23:49:36 +0800</pubDate><description><![CDATA[LeetCode Algorithm部分.399【399】 Evaluate Division
  Equations are given in the format A / B = k, where A and B are variables represented as strings, and k is a real number (floating point number). Given]]></description><category></category></item><item><title><![CDATA[LeetCode部分题解]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/68957695</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/68957695</guid><author>mattmu</author><pubDate>Mon, 03 Apr 2017 11:04:54 +0800</pubDate><description><![CDATA[LeetCode Algorithm部分.515【515】 Find Bottom Left Tree Value
  You need to find the largest value in each row of a binary tree.
  
  Example:
  
  
    Input: 
       1
    / \
   3   2
  / \   \  
 5   3]]></description><category></category></item><item><title><![CDATA[LeetCode部分题解]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/68957683</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/68957683</guid><author>mattmu</author><pubDate>Mon, 03 Apr 2017 11:02:24 +0800</pubDate><description><![CDATA[LeetCode Algorithm部分.513【513】 Find Bottom Left Tree Value
  Given a binary tree, find the leftmost value in the last row of the tree.
  
  Example 1:
  
  
    Input:
    
    2 
       / \ 
      1]]></description><category></category></item><item><title><![CDATA[LeetCode部分题解]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/66473533</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/66473533</guid><author>mattmu</author><pubDate>Sun, 26 Mar 2017 12:36:26 +0800</pubDate><description><![CDATA[LeetCode Algorithm部分.542【542】01 Matrix
  Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.  
  The distance between two adjacent cells is 1.  
  Example 1:  
  Input]]></description><category></category></item><item><title><![CDATA[LeetCode Algorithm部分]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/63848669</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/63848669</guid><author>mattmu</author><pubDate>Mon, 20 Mar 2017 00:33:55 +0800</pubDate><description><![CDATA[LeetCode Algorithm部分.004【004】 Search a 2D Matrix II
  Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).]]></description><category></category></item><item><title><![CDATA[LeetCode部分题解]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/61696654</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/61696654</guid><author>mattmu</author><pubDate>Sun, 12 Mar 2017 23:35:17 +0800</pubDate><description><![CDATA[LeetCode部分题解]]></description><category></category></item><item><title><![CDATA[LeetCode部分题解]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/60481170</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/60481170</guid><author>mattmu</author><pubDate>Sun, 05 Mar 2017 23:25:31 +0800</pubDate><description><![CDATA[LeetCode 部分题解]]></description><category></category></item><item><title><![CDATA[LeetCode部分题解]]></title><link>https://blog.youkuaiyun.com/mattmu/article/details/57193708</link><guid>https://blog.youkuaiyun.com/mattmu/article/details/57193708</guid><author>mattmu</author><pubDate>Sun, 26 Feb 2017 00:20:18 +0800</pubDate><description><![CDATA[LeetCode Algorithm部分【145】Binary Tree Postorder Traversal
  Given a binary tree, return the postorder traversal of its nodes’ values.
  
  For example: 
  Given binary tree {1,#,2,3},
  
  
    1]]></description><category></category></item></channel></rss>