<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[user_name_is_so_long的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/user_name_is_so_long</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; user_name_is_so_long]]></copyright><item><title><![CDATA[[Algorithm] Chapter 8_8.3]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78941096</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78941096</guid><author>user_name_is_so_long</author><pubDate>Sun, 31 Dec 2017 11:31:14 +0800</pubDate><description><![CDATA[[Algorithm] Chapter 8_8.3
题目描述
解答过程
题目描述STINGY SAT is th following problem: given a set of clauses (each a disjunction of literals) and an integer k, find a satisfying assignment in which at most k var]]></description><category></category></item><item><title><![CDATA[[LeetCode] 111.Minimum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78908077</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78908077</guid><author>user_name_is_so_long</author><pubDate>Wed, 27 Dec 2017 07:55:04 +0800</pubDate><description><![CDATA[[LeetCode] 111.Minimum Depth of Binary Tree
题目描述
解题思路
实验代码
题目描述Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to th]]></description><category></category></item><item><title><![CDATA[[LeetCode] 167.Two Sum II - Input array is sorted]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78841320</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78841320</guid><author>user_name_is_so_long</author><pubDate>Tue, 19 Dec 2017 12:31:14 +0800</pubDate><description><![CDATA[[LeetCode] 167.Two Sum II - Input array is sorted
题目描述
解题思路
实验代码
题目描述Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target nu]]></description><category></category></item><item><title><![CDATA[[LeetCode] 669.Trim a Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78787698</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78787698</guid><author>user_name_is_so_long</author><pubDate>Wed, 13 Dec 2017 03:08:27 +0800</pubDate><description><![CDATA[[LeetCode] 669.Trim a Binary Search Tree
题目描述
解题思路
实验代码
题目描述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 >= L).]]></description><category></category></item><item><title><![CDATA[[LeetCode] 620.Not Boring Movies]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78748638</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78748638</guid><author>user_name_is_so_long</author><pubDate>Fri, 08 Dec 2017 10:11:22 +0800</pubDate><description><![CDATA[[LeetCode] 620.Not Boring Movies
题目描述
解题思路
实验代码
题目描述X city opened a new cinema, many people would like to go to this cinema. The cinema also gives out a poster indicating the movies’ ratings and descri]]></description><category></category></item><item><title><![CDATA[[LeetCode] 500.Keyboard Row]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78748242</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78748242</guid><author>user_name_is_so_long</author><pubDate>Fri, 08 Dec 2017 09:38:02 +0800</pubDate><description><![CDATA[[LeetCode] 500.Keyboard Row
题目描述
解题思路
实验代码
题目描述Given a List of words, return the words that can be typed using letters of alphabet on only one row’s of American keyboard like the image below.Example:]]></description><category></category></item><item><title><![CDATA[[LeetCode] 557.Reverse Words in a String III]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78743814</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78743814</guid><author>user_name_is_so_long</author><pubDate>Thu, 07 Dec 2017 17:27:27 +0800</pubDate><description><![CDATA[[LeetCode] 557.Reverse Words in a String III
题目描述
解题思路
实验代码
题目描述Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial]]></description><category></category></item><item><title><![CDATA[[LeetCode] 461.Hamming Distance]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78743304</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78743304</guid><author>user_name_is_so_long</author><pubDate>Thu, 07 Dec 2017 16:53:21 +0800</pubDate><description><![CDATA[[LeetCode] 461.Hamming Distance
题目描述
解题思路
实验代码
题目描述The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calcula]]></description><category></category></item><item><title><![CDATA[[LeetCode] 627.Swap Salary]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78742903</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78742903</guid><author>user_name_is_so_long</author><pubDate>Thu, 07 Dec 2017 16:29:40 +0800</pubDate><description><![CDATA[[LeetCode] 627.Swap Salary
题目描述
解题思路
实验代码
题目描述Given a table salary, such as the one below, that has m=male and f=female values. Swap all f and m values (i.e., change all f values to m and vice versa) w]]></description><category></category></item><item><title><![CDATA[[LeetCode] 617.Merge Two Binary Trees]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78742751</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78742751</guid><author>user_name_is_so_long</author><pubDate>Thu, 07 Dec 2017 16:20:26 +0800</pubDate><description><![CDATA[[LeetCode] 617.Merge Two Binary Trees
题目描述
解题思路
实验代码
题目描述Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others]]></description><category></category></item><item><title><![CDATA[[LeetCode] 657.Judge Route Circle]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78742181</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78742181</guid><author>user_name_is_so_long</author><pubDate>Thu, 07 Dec 2017 15:44:25 +0800</pubDate><description><![CDATA[[LeetCode] 657.Judge Route Circle
题目描述
解题思路
实验代码
题目描述Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the]]></description><category></category></item><item><title><![CDATA[[LeetCode] 728.Self Dividing Numbers]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78741998</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78741998</guid><author>user_name_is_so_long</author><pubDate>Thu, 07 Dec 2017 15:32:11 +0800</pubDate><description><![CDATA[[LeetCode] 728.Self Dividing Numbers
题目描述
解题思路
实验代码
题目描述A self-dividing number is a number that is divisible by every digit it contains.For example, 128 is a self-dividing number because 128 % 1 == 0,]]></description><category></category></item><item><title><![CDATA[[LeetCode] 595.Big Countries]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78741603</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78741603</guid><author>user_name_is_so_long</author><pubDate>Thu, 07 Dec 2017 15:06:58 +0800</pubDate><description><![CDATA[[LeetCode] 595.Big Countries
题目描述
解题思路
实验代码
题目描述There is a table World
  name
  continent
  area
  population
  gdp  Afghanistan
  Asia
  652230
  25500100
  20343000
  Albania
  Europe
  28748
  28317]]></description><category></category></item><item><title><![CDATA[[LeetCode] 26.Remove Duplicates from Sorted Array]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78740964</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78740964</guid><author>user_name_is_so_long</author><pubDate>Thu, 07 Dec 2017 14:24:58 +0800</pubDate><description><![CDATA[[LeetCode] 26.Remove Duplicates from Sorted Array
题目描述
解题思路
实验代码
题目描述Given a sorted array, remove the duplicates in-place such that each element appear only once and return the new length.Do not alloca]]></description><category></category></item><item><title><![CDATA[[LeetCode] 35.Search Insert Position]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78727093</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78727093</guid><author>user_name_is_so_long</author><pubDate>Wed, 06 Dec 2017 09:26:37 +0800</pubDate><description><![CDATA[[LeetCode] 35.Search Insert Position
题目描述
解题思路
实验代码
题目描述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]]></description><category></category></item><item><title><![CDATA[[LeetCode] 27.Remove Element]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78650767</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78650767</guid><author>user_name_is_so_long</author><pubDate>Tue, 28 Nov 2017 00:18:28 +0800</pubDate><description><![CDATA[[LeetCode] 27.Remove Element
题目描述
解题思路
实验代码
题目描述Given an array and a value, remove all instances of that value in-place and return the new length.Do not allocate extra space for another array, you must]]></description><category></category></item><item><title><![CDATA[Golang中gzip过滤器的源码分析与解释]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78607131</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78607131</guid><author>user_name_is_so_long</author><pubDate>Wed, 22 Nov 2017 19:46:46 +0800</pubDate><description><![CDATA[Golang中gzip过滤器的源码分析与解释与上次相同，这次gzip过滤器的源码，依旧是使用LiteIDE中自带的源码阅读功能来解读的。个人感觉在Go语言的学习中这款软件非常方便这次我们对gzip包的源码做个整体分析。下面就一部分一部分来看。引用的包可看到gzip包引用了如下包：package gzipimport (
    "compress/flate"
    "errors"
    "f]]></description><category></category></item><item><title><![CDATA[[LeetCode] 9.Palindrome Number]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78598661</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78598661</guid><author>user_name_is_so_long</author><pubDate>Wed, 22 Nov 2017 04:41:54 +0800</pubDate><description><![CDATA[[LeetCode] 9.Palindrome Number
题目描述
解题思路
实验代码
题目描述Determine whether an integer is a palindrome. Do this without extra space.解题思路题目很简单：判断一个整数是否为回文数。那么首先要明白一个概念，什么是回文数：设n是一任意自然数。若将n的各位数字反向排列所得自然数n1与n相等，则]]></description><category></category></item><item><title><![CDATA[Golang中net/http包源码分析与解释]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78537255</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78537255</guid><author>user_name_is_so_long</author><pubDate>Wed, 15 Nov 2017 09:30:49 +0800</pubDate><description><![CDATA[Golang中net/http包源码分析与解释关于Golang语言的源码，我一直是使用LiteIDE中自带的源码阅读功能来解读的。这次对于net/http包的源码阅读与分析也是通过LiteIDE软件来完成的。 
打开net/http包的相关源码，可以看出Golang对于http相关的操作有很多很完善的源码支持。比如对于server、client、transfer等等的操作。由于源码数量和功能很多，所]]></description><category></category></item><item><title><![CDATA[[LeetCode] 1.Two Sum]]></title><link>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78536790</link><guid>https://blog.youkuaiyun.com/user_name_is_so_long/article/details/78536790</guid><author>user_name_is_so_long</author><pubDate>Wed, 15 Nov 2017 04:37:01 +0800</pubDate><description><![CDATA[[LeetCode] 1.Two Sum
题目描述
解题思路
实验代码
题目描述Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one so]]></description><category></category></item></channel></rss>