<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Pokemon_Master的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Pokemon_Master</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Pokemon_Master]]></copyright><item><title><![CDATA[分布式学习（一）]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/84898624</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/84898624</guid><author>Pokemon_Master</author><pubDate>Sun, 09 Dec 2018 10:25:00 +0800</pubDate><description><![CDATA[前言：

最近到毕业的季节了，想着在工作前锻炼下自己阅读英文文献的能力，又对分布式有兴趣，就开了分布式的坑。国内分布式资料较少，因此参考了mit的课程：http://nil.csail.mit.edu/6.824/2015/schedule.html

这门课虽然没有视频，但是给出了分布式相关的论文，并设置了5个实验（go语言），今天终于完成了lab1.有需要的同学可自取。

 

Lab1

第...]]></description><category></category></item><item><title><![CDATA[LeetCode——Maximum Binary Tree（654）]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/83615232</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/83615232</guid><author>Pokemon_Master</author><pubDate>Thu, 01 Nov 2018 09:57:40 +0800</pubDate><description><![CDATA[Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:

The root is the maximum number in the array.
	The left subtree is the maximum tree constructed f...]]></description><category></category></item><item><title><![CDATA[LeetCode——Trim a Binary Search Tree（669）]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/83584371</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/83584371</guid><author>Pokemon_Master</author><pubDate>Wed, 31 Oct 2018 15:08:18 +0800</pubDate><description><![CDATA[Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R &amp;gt;= L). You might need to change the root of the tree, so the re...]]></description><category></category></item><item><title><![CDATA[LeetCode——Convert Sorted Array to Binary Search Tree（108）]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/83573204</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/83573204</guid><author>Pokemon_Master</author><pubDate>Wed, 31 Oct 2018 09:13:50 +0800</pubDate><description><![CDATA[Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the...]]></description><category></category></item><item><title><![CDATA[LeetCode——Maximum Depth of N-ary Tree（559）]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/83105452</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/83105452</guid><author>Pokemon_Master</author><pubDate>Wed, 17 Oct 2018 10:08:47 +0800</pubDate><description><![CDATA[Given a n-ary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

For example, given a 3-ary tree:

 



...]]></description><category></category></item><item><title><![CDATA[LeetCode——Uncommon Words from Two Sentences（884）]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/83099022</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/83099022</guid><author>Pokemon_Master</author><pubDate>Tue, 16 Oct 2018 22:58:14 +0800</pubDate><description><![CDATA[We are given two sentences A and B.  (A sentence is a string of space separated words.  Each word consists only of lowercase letters.)

A word is uncommon if it appears exactly once in one of the sent...]]></description><category></category></item><item><title><![CDATA[LeetCode——Leaf-Similar Trees（872）]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/83007006</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/83007006</guid><author>Pokemon_Master</author><pubDate>Thu, 11 Oct 2018 09:37:39 +0800</pubDate><description><![CDATA[Consider all the leaves of a binary tree.  From left to right order, the values of those leaves form a leaf value sequence.



For example, in the given tree above, the leaf value sequence is (6, 7, 4...]]></description><category></category></item><item><title><![CDATA[LeetCode——sort list（148）]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82988764</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82988764</guid><author>Pokemon_Master</author><pubDate>Wed, 10 Oct 2018 10:36:42 +0800</pubDate><description><![CDATA[Sort a linked list in O(n log n) time using constant space complexity.

Example 1:


Input: 4-&amp;gt;2-&amp;gt;1-&amp;gt;3
Output: 1-&amp;gt;2-&amp;gt;3-&amp;gt;4


Example 2:


Input: -1-&amp;gt;5-&amp;gt;3-&amp;gt;4-&amp;gt;0
Output: -1-...]]></description><category></category></item><item><title><![CDATA[LeetCode——N-ary Tree Postorder Traversal(590)]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82980447</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82980447</guid><author>Pokemon_Master</author><pubDate>Tue, 09 Oct 2018 12:19:59 +0800</pubDate><description><![CDATA[Given an n-ary tree, return the postorder traversal of its nodes' values.

 

For example, given a 3-ary tree:



 

Return its postorder traversal as: [5,6,3,2,4,1].

 

Note: Recursive solution is t...]]></description><category></category></item><item><title><![CDATA[LeetCode—— Longest Consecutive Sequence(128)]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82866141</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82866141</guid><author>Pokemon_Master</author><pubDate>Thu, 27 Sep 2018 14:00:11 +0800</pubDate><description><![CDATA[Given an unsorted array of integers, find the length of the longest consecutive elements sequence.

Your algorithm should run in O(n) complexity.

Example:


Input: [100, 4, 200, 1, 3, 2]
Output: 4
Ex...]]></description><category></category></item><item><title><![CDATA[LeetCode——Merge k Sorted Lists(23)]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82852901</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82852901</guid><author>Pokemon_Master</author><pubDate>Wed, 26 Sep 2018 15:41:04 +0800</pubDate><description><![CDATA[Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

Example:


Input:
[
  1-&amp;gt;4-&amp;gt;5,
  1-&amp;gt;3-&amp;gt;4,
  2-&amp;gt;6
]
Output: 1-&amp;gt;1-&amp;gt;2-&amp;gt;3-&amp;gt;4-...]]></description><category></category></item><item><title><![CDATA[LeetCode——Move Zeroes(283)]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82848385</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82848385</guid><author>Pokemon_Master</author><pubDate>Wed, 26 Sep 2018 09:13:49 +0800</pubDate><description><![CDATA[Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.

Example:


Input: [0,1,0,3,12]
Output: [1,3,12,0,0]

Note:

You m...]]></description><category></category></item><item><title><![CDATA[LeetCode——Single Number（136）]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82843563</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82843563</guid><author>Pokemon_Master</author><pubDate>Tue, 25 Sep 2018 19:11:07 +0800</pubDate><description><![CDATA[Given a non-empty array of integers, every element appears twice except for one. Find that single one.

Note:

Your algorithm should have a linear runtime complexity. Could you implement it without us...]]></description><category></category></item><item><title><![CDATA[LeetCode——Shortest Distance to a Character(821)]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82826835</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82826835</guid><author>Pokemon_Master</author><pubDate>Mon, 24 Sep 2018 08:59:07 +0800</pubDate><description><![CDATA[Given a string S and a character C, return an array of integers representing the shortest distance from the character C in the string.

Example 1:


Input: S = &quot;loveleetcode&quot;, C = 'e'
Output: [3, 2, 1...]]></description><category></category></item><item><title><![CDATA[LeetCode——N-ary Tree Postorder Traversal(590)]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82819807</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82819807</guid><author>Pokemon_Master</author><pubDate>Sun, 23 Sep 2018 08:29:29 +0800</pubDate><description><![CDATA[Given an n-ary tree, return the postorder traversal of its nodes' values.

 

For example, given a 3-ary tree:



 

Return its postorder traversal as: [5,6,3,2,4,1].

 

分析：

典型的树遍历

代码：


/*
// Defi...]]></description><category></category></item><item><title><![CDATA[LeetCode——Distinct Subsequences(115)]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82774806</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82774806</guid><author>Pokemon_Master</author><pubDate>Wed, 19 Sep 2018 16:58:43 +0800</pubDate><description><![CDATA[Given a string S and a string T, count the number of distinct subsequences of S which equals T.

A subsequence of a string is a new string which is formed from the original string by deleting some (ca...]]></description><category></category></item><item><title><![CDATA[LeetCode——Triangle(120)]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82767659</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82767659</guid><author>Pokemon_Master</author><pubDate>Wed, 19 Sep 2018 09:55:49 +0800</pubDate><description><![CDATA[Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.

For example, given the following triangle


[
     [2],
    [3,4],
   [6,5...]]></description><category></category></item><item><title><![CDATA[LeetCode——Palindrome Partitioning II（132）]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82759320</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82759320</guid><author>Pokemon_Master</author><pubDate>Tue, 18 Sep 2018 16:17:51 +0800</pubDate><description><![CDATA[Given a string s, partition s such that every substring of the partition is a palindrome.

Return the minimum cuts needed for a palindrome partitioning of s.

Example:


Input: &quot;aab&quot;
Output: 1
Explana...]]></description><category></category></item><item><title><![CDATA[LeetCode——work-break-ii（140）]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82755003</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82755003</guid><author>Pokemon_Master</author><pubDate>Tue, 18 Sep 2018 12:25:26 +0800</pubDate><description><![CDATA[Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible ...]]></description><category></category></item><item><title><![CDATA[LeetCode ——word-break]]></title><link>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82747217</link><guid>https://blog.youkuaiyun.com/Pokemon_Master/article/details/82747217</guid><author>Pokemon_Master</author><pubDate>Mon, 17 Sep 2018 18:55:38 +0800</pubDate><description><![CDATA[题目描述

 

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.

For example, givens =&quot;leetcode&quot;,dict =[&quot;leet...]]></description><category></category></item></channel></rss>