<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sinat_34538469的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sinat_34538469</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sinat_34538469]]></copyright><item><title><![CDATA[hadoop搭建问题]]></title><link>https://blog.youkuaiyun.com/sinat_34538469/article/details/90551336</link><guid>https://blog.youkuaiyun.com/sinat_34538469/article/details/90551336</guid><author>sinat_34538469</author><pubDate>Sat, 25 May 2019 20:49:51 +0800</pubDate><description><![CDATA[Hadoop平台搭建过程及问题解决
使用VM：

文件：

注：hadoop不能下载-src版本的：得编译，不能直接用，非-src的改配置文件就可以直接用。 CentOS自带的JDK不能用，得下载oracle的。
下载链接：
http://ftp.agdsn.de/pub/mirrors/centos/7.6.1810/isos/x86_64/CentOS-7-x86_64-DVD-1810.is...]]></description><category></category></item><item><title><![CDATA[204. Count Primes  Python代码]]></title><link>https://blog.youkuaiyun.com/sinat_34538469/article/details/90403272</link><guid>https://blog.youkuaiyun.com/sinat_34538469/article/details/90403272</guid><author>sinat_34538469</author><pubDate>Tue, 21 May 2019 11:17:14 +0800</pubDate><description><![CDATA[Count the number of prime numbers less than a non-negative number, n.
Example:
Input: 10
Output: 4
Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.
算法的思想就是以此通过：22,33,44,55…ii；...]]></description><category></category></item><item><title><![CDATA[859. Buddy Strings  Python代码]]></title><link>https://blog.youkuaiyun.com/sinat_34538469/article/details/90298602</link><guid>https://blog.youkuaiyun.com/sinat_34538469/article/details/90298602</guid><author>sinat_34538469</author><pubDate>Fri, 17 May 2019 18:35:34 +0800</pubDate><description><![CDATA[Given two strings A and B of lowercase letters, return true if and only if we can swap two letters in A so that the result equals B.
Example 1:
Input: A = “ab”, B = “ba”
Output: true
Example 2:
Input:...]]></description><category></category></item><item><title><![CDATA[559. Maximum Depth of N-ary Tree  Python代码]]></title><link>https://blog.youkuaiyun.com/sinat_34538469/article/details/90271600</link><guid>https://blog.youkuaiyun.com/sinat_34538469/article/details/90271600</guid><author>sinat_34538469</author><pubDate>Thu, 16 May 2019 20:38:12 +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:

We shou...]]></description><category></category></item><item><title><![CDATA[665. Non-decreasing Array Python代码]]></title><link>https://blog.youkuaiyun.com/sinat_34538469/article/details/90267214</link><guid>https://blog.youkuaiyun.com/sinat_34538469/article/details/90267214</guid><author>sinat_34538469</author><pubDate>Thu, 16 May 2019 16:59:47 +0800</pubDate><description><![CDATA[Non-decreasing Array
Given an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element.

We define an array is non-decreasing if array[i] &lt;= ar...]]></description><category></category></item></channel></rss>