<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[csdn_chuxuezhe的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/csdn_chuxuezhe</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; csdn_chuxuezhe]]></copyright><item><title><![CDATA[【LeetCode】[56] Merge Intervals]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/89713467</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/89713467</guid><author>csdn_chuxuezhe</author><pubDate>Tue, 30 Apr 2019 18:28:12 +0800</pubDate><description><![CDATA[Given a collection of intervals, merge all overlapping intervals.

Example 1:


Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Since intervals [1,3] and [2,6] overlaps...]]></description><category></category></item><item><title><![CDATA[spark中实现ansj遇到NoClassDefFoundError错误]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/86527142</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/86527142</guid><author>csdn_chuxuezhe</author><pubDate>Thu, 17 Jan 2019 16:48:07 +0800</pubDate><description><![CDATA[目的：在spark是实现ansj中文分词功能。

错误：总是报错19/01/17 16:23:08 INFO scheduler.DAGScheduler: ResultStage 0 (foreach at demo.scala:17) failed in 9.567 s due to Job aborted due to stage failure: Task 0 in stage 0.0 f...]]></description><category></category></item><item><title><![CDATA[【转】hadoop 集群开启之后datanode没有启动]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/84849941</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/84849941</guid><author>csdn_chuxuezhe</author><pubDate>Thu, 06 Dec 2018 11:37:56 +0800</pubDate><description><![CDATA[datanode没有启动
将hadoop配置文件修改后，重新格式化了hadoop集群，即
hadoop name -format
但是此时发现slave节点没有启动datanode
上网查找解决方法，最后终于解决了，解决方法如下：
1. 先执行stop-all.sh暂停所有服务
2. 将所有Salve节点上的tmp(即 hdfs-site.xml 中指定的 dfs.data.dir 文件夹，Dat...]]></description><category></category></item><item><title><![CDATA[spring boot中@Autowired的类是null]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/82790163</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/82790163</guid><author>csdn_chuxuezhe</author><pubDate>Thu, 20 Sep 2018 16:56:41 +0800</pubDate><description><![CDATA[今天使用springboot框架写程序，遇到一个问题。是这样的：

        我在一个java类A中定义一个函数a1，然后在另一个的类B中用函数b1调用了函数a1。但是，我在类A中使用注解@Autowired调用了其他类C，然后在函数a1中使用了C类中的函数。但是A类中的注解@Autowired实例的c返回是null。

出现问题原因是：我在类B中使用类A中函数，是用的new新建的A类对象，...]]></description><category></category></item><item><title><![CDATA[【链表】链表翻转，合并，以及倒数第k个数]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/82695754</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/82695754</guid><author>csdn_chuxuezhe</author><pubDate>Thu, 13 Sep 2018 22:13:58 +0800</pubDate><description><![CDATA[链表的翻转

1. 代码中指明了链表的定义，以及初始化，初始化使用尾插法实现。

2. 链表的翻转采用三种方式，分别是递归，栈，以及对链表逆序后，再输出

代码如下：


#include &amp;lt;iostream&amp;gt;
#include&amp;lt;stack&amp;gt;
using namespace std;
typedef struct Node{
    int data;
    Node* ...]]></description><category></category></item><item><title><![CDATA[【堆】堆的定义以及堆排序]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/82495505</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/82495505</guid><author>csdn_chuxuezhe</author><pubDate>Fri, 07 Sep 2018 14:05:06 +0800</pubDate><description><![CDATA[堆的定义：

堆是一类特殊的数据结构统称，堆通常可以被看做一颗树的数组对象。

堆满足下列性质：

1）堆中某个节点的值总是不大于或不小于其父节点的值

2）堆总是一颗完全二叉树。

完全二叉树：除最后一层外，每一层上的节点数均达到最大值；在最后一层上只缺少右边的若干结点。

满二叉树：树中除了叶子节点，每个节点都有两个子节点

完美二叉树：满足完全二叉树性质，树的叶子节点均在最后一层（也就是形成...]]></description><category></category></item><item><title><![CDATA[【链表】链表的操作（二）]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81984281</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81984281</guid><author>csdn_chuxuezhe</author><pubDate>Thu, 23 Aug 2018 17:03:56 +0800</pubDate><description><![CDATA[上一篇写了链表的基本概念，这一篇通过在C++上建链表，实现基本的输入输出，筛选功能进行测试。

代码：


#include &amp;lt;iostream&amp;gt;
#include&amp;lt;stdio.h&amp;gt;
#include &amp;lt;stdlib.h&amp;gt;
using namespace std;
#define OK 1
#define ERROR 0

typedef struct Node...]]></description><category></category></item><item><title><![CDATA[【链表】链表的基本概念和操作（一）]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81982280</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81982280</guid><author>csdn_chuxuezhe</author><pubDate>Thu, 23 Aug 2018 16:21:21 +0800</pubDate><description><![CDATA[一. 链表的基本概念

根据《数据结构》书中介绍，一个线性表是n个数据元素的有限序列，它的长度可根据需要增长或缩短，还有一系列对线性表的操作。

线性表可分为顺序存储结构和链式存储结构两种。

顺序存储结构的特点是逻辑关系上相邻的两个元素在物理位置上也相邻。

链式存储结构的特点是不需要逻辑上相邻的元素在物理位置上也相邻。

下面重点介绍一下链式存储结构的线性链表，线性链表可分为单链表，循环链表，...]]></description><category></category></item><item><title><![CDATA[【Leetcode】[53]  Maximum Subarray]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81843090</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81843090</guid><author>csdn_chuxuezhe</author><pubDate>Sun, 19 Aug 2018 22:42:29 +0800</pubDate><description><![CDATA[Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:


Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanati...]]></description><category></category></item><item><title><![CDATA[【LeetCode】[55] Jump Game]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81842709</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81842709</guid><author>csdn_chuxuezhe</author><pubDate>Sun, 19 Aug 2018 22:10:24 +0800</pubDate><description><![CDATA[Given an array of non-negative integers, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Determine if yo...]]></description><category></category></item><item><title><![CDATA[【笔试】区间合并]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81606837</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81606837</guid><author>csdn_chuxuezhe</author><pubDate>Sun, 12 Aug 2018 15:44:08 +0800</pubDate><description><![CDATA[ 做笔试题遇到一道区间合并的题目，给定若干区间[1,2] [2,3] [4,5]合并有覆盖的区间，即为[1,3] [4,5]。经过在网上搜索类似题目，得到两种解题思路。类似题目是LeetCode上的56题目

思路1.如果区间的端点范围很小，比如在范围[0,9999]。可以开一个10000大小的bool数组，然后输入区间覆盖的范围都复制true。则最后遍历数组，连续的true数据即为一个区间。这种...]]></description><category></category></item><item><title><![CDATA[【Leetcode】[39] Combination Sum]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81570438</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81570438</guid><author>csdn_chuxuezhe</author><pubDate>Fri, 10 Aug 2018 21:56:55 +0800</pubDate><description><![CDATA[Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

The same repeat...]]></description><category></category></item><item><title><![CDATA[【Leetcode】[46] Permutations]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81544078</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81544078</guid><author>csdn_chuxuezhe</author><pubDate>Thu, 09 Aug 2018 21:09:18 +0800</pubDate><description><![CDATA[Given a collection of distinct integers, return all possible permutations.

Example:


Input: [1,2,3]
Output:
[
  [1,2,3],
  [1,3,2],
  [2,1,3],
  [2,3,1],
  [3,1,2],
  [3,2,1]
]

题目：给定不同的整数序列，输出所有可能的...]]></description><category></category></item><item><title><![CDATA[【LeetCode】[90]Subsets II]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81531206</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81531206</guid><author>csdn_chuxuezhe</author><pubDate>Thu, 09 Aug 2018 10:24:54 +0800</pubDate><description><![CDATA[Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).

Note: The solution set must not contain duplicate subsets.

Example:


Input: [1,2,2]
...]]></description><category></category></item><item><title><![CDATA[【递归】递归函数]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81435624</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81435624</guid><author>csdn_chuxuezhe</author><pubDate>Sun, 05 Aug 2018 21:53:13 +0800</pubDate><description><![CDATA[本文是学习谭浩强递归调用章节的总结。

1.函数的递归：在调用一个函数的过程中又出现直接或间接地调用该函数本身，称为函数的递归调用。

例子：有5个人做在一起，问第5个人多少岁，他说比第4个人大2岁。问第4个人多少岁，他说比第3个人大2岁。依次类推，第1个人10岁。请问第5个人多大？

这是一个递归问题，求解分为两个阶段，第一个阶段是“回推”，将第n个人的年龄表示为第n-1个人年龄的函数，依次回推...]]></description><category></category></item><item><title><![CDATA[【Leetcode】[6] ZigZag Conversion]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81415697</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81415697</guid><author>csdn_chuxuezhe</author><pubDate>Sat, 04 Aug 2018 21:36:42 +0800</pubDate><description><![CDATA[The string &quot;PAYPALISHIRING&quot; is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)


P   A   H   N
A P L S I I...]]></description><category></category></item><item><title><![CDATA[【Leetcode】[5] Longest Palindromic Substring]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81411374</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81411374</guid><author>csdn_chuxuezhe</author><pubDate>Sat, 04 Aug 2018 15:31:07 +0800</pubDate><description><![CDATA[题目：Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

给定一个字符串s，找到s中最长的回文子字符串。 您可以假设s的最大长度为1000

输入输出：


1.
Input: &quot;babad&quot;
Output: &quot;bab...]]></description><category></category></item><item><title><![CDATA[centos更新gcc g++]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81208844</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81208844</guid><author>csdn_chuxuezhe</author><pubDate>Wed, 25 Jul 2018 21:47:59 +0800</pubDate><description><![CDATA[CentOS 6.6 升级GCC G++ (当前最新GCC/G++版本为v6.1.0)

没有便捷方式,

yum update....   yum install 

或者 添加yum 的 repo 文件 也不行, 只能更新到 4.4.7!

then,  只能手动编译安装了,那么开始第一步下载源代码吧,GO!

1、 获取安装包并解压

wget http://ftp.gnu.org/gnu/...]]></description><category></category></item><item><title><![CDATA[（转载）修改CentOS默认yum源为国内yum镜像源]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81208598</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/81208598</guid><author>csdn_chuxuezhe</author><pubDate>Wed, 25 Jul 2018 19:21:24 +0800</pubDate><description><![CDATA[有时候CentOS默认的yum源不一定是国内镜像，导致yum在线安装及更新速度不是很理想。这时候需要将yum源设置为国内镜像站点。国内主要开源的开源镜像站点应该是网易和阿里云了。

转载：https://blog.youkuaiyun.com/inslow/article/details/54177191

修改CentOS默认yum源为mirrors.163.com

1、首先备份系统自带yum源配置文件/...]]></description><category></category></item><item><title><![CDATA[子网划分]]></title><link>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/80949798</link><guid>https://blog.youkuaiyun.com/csdn_chuxuezhe/article/details/80949798</guid><author>csdn_chuxuezhe</author><pubDate>Sat, 07 Jul 2018 11:44:53 +0800</pubDate><description><![CDATA[1.定义    IP地址由32位二进制组成，Internet组织机构根据网络号和主机号位数不同，IP地址分成A,B,C,D,E，5类地址，其中A,B，C类地址最常用。    A类地址：网络号占8位，主机号占24位。特点：前1位为0，网络号的范围：1.0.0.0~126.0.0.0。默认子网掩码：255.0.0.0    最大网络数127个（1~126是可用的，127作为本地软件回测本主机之用），网...]]></description><category></category></item></channel></rss>