<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Perfect_chen的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/Perfect_chen</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; Perfect_chen]]></copyright><item><title><![CDATA[epoll EPOLLOUT事件未触发]]></title><link>https://blog.csdn.net/Perfect_chen/article/details/125194457</link><guid>https://blog.csdn.net/Perfect_chen/article/details/125194457</guid><author>Perfect_chen</author><pubDate>Wed, 08 Jun 2022 23:19:09 +0800</pubDate><description><![CDATA[tcp发送缓冲区满，epoll EPOLLOUT事件未触发]]></description><category></category></item><item><title><![CDATA[【AVL】平衡二叉树]]></title><link>https://blog.csdn.net/Perfect_chen/article/details/123536249</link><guid>https://blog.csdn.net/Perfect_chen/article/details/123536249</guid><author>Perfect_chen</author><pubDate>Wed, 16 Mar 2022 21:09:02 +0800</pubDate><description><![CDATA[平衡二叉树用在hashmap中有很好的性能优势，对查询量对的场景特别适合。]]></description><category></category></item><item><title><![CDATA[Dijkstra算法]]></title><link>https://blog.csdn.net/Perfect_chen/article/details/114101939</link><guid>https://blog.csdn.net/Perfect_chen/article/details/114101939</guid><author>Perfect_chen</author><pubDate>Thu, 25 Feb 2021 19:28:46 +0800</pubDate><description><![CDATA[迪杰斯特拉（Dijkstra）算法求到各顶点的最短路径


#include&lt;iostream&gt;
#include&lt;stdlib.h&gt;

#define MAXINT  100000000
using namespace std;


void ShortestPath_Dijkstra(int **G, int n, int v)
{
	if ( v &gt;= n ) return;
	bool S[n]; //标记顶点i是否求从源点到顶点的最短路径 
	int path[n];]]></description><category></category></item><item><title><![CDATA[二叉搜索树]]></title><link>https://blog.csdn.net/Perfect_chen/article/details/113098924</link><guid>https://blog.csdn.net/Perfect_chen/article/details/113098924</guid><author>Perfect_chen</author><pubDate>Sun, 24 Jan 2021 22:24:28 +0800</pubDate><description><![CDATA[二叉搜索树相比其他排序算法并没有体现出优势，但是二叉搜索树是其他算法的基础算法，如红黑树。]]></description><category></category></item><item><title><![CDATA[最长公共子序列问题]]></title><link>https://blog.csdn.net/Perfect_chen/article/details/112645345</link><guid>https://blog.csdn.net/Perfect_chen/article/details/112645345</guid><author>Perfect_chen</author><pubDate>Thu, 14 Jan 2021 23:58:25 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;cstring&gt;
#include&lt;cmath&gt;

using namespace std;
/*****************************************/
/*

最长公共子序列，带备忘录的自底向上的求解过程

*/
/*****************************************/

int lcs(char * s1, char *s2, int **note)
{.]]></description><category></category></item><item><title><![CDATA[动态规划寻找最优解（钢条切割问题）]]></title><link>https://blog.csdn.net/Perfect_chen/article/details/112596085</link><guid>https://blog.csdn.net/Perfect_chen/article/details/112596085</guid><author>Perfect_chen</author><pubDate>Wed, 13 Jan 2021 22:21:05 +0800</pubDate><description><![CDATA[标题动态规划寻找最优解（钢条切割问题）

1、自上而下的方式
1.1 朴素递归

#include&lt;iostream&gt;
#include&lt;cstdlib&gt;


using namespace std;
/***************************************/
/*


自上而下的设计：朴素递归方式寻找最优解

当n稍大时非常消耗性能，效率极低


*/
/***************************************/


int cut(i]]></description><category></category></item><item><title><![CDATA[otter 做数据同步]]></title><link>https://blog.csdn.net/Perfect_chen/article/details/105552696</link><guid>https://blog.csdn.net/Perfect_chen/article/details/105552696</guid><author>Perfect_chen</author><pubDate>Thu, 16 Apr 2020 11:00:58 +0800</pubDate><description><![CDATA[pid:1 nid:1 exception:canal:example:java.net.SocketTimeoutException: Timeout occurred, failed to read total 4 bytes in 25000 milliseconds, actual read only 0 bytes
  at com.alibaba.otter.canal.parse.driver.mysql.socket.BioSocketChannel.read(BioSocketChan]]></description><category></category></item><item><title><![CDATA[Hbase报Master is initializing的异常]]></title><link>https://blog.csdn.net/Perfect_chen/article/details/103749178</link><guid>https://blog.csdn.net/Perfect_chen/article/details/103749178</guid><author>Perfect_chen</author><pubDate>Sat, 28 Dec 2019 22:07:41 +0800</pubDate><description><![CDATA[hbase(main):001:0> list
TABLE

ERROR: org.apache.hadoop.hbase.PleaseHoldException: Master is initializing
        at org.apache.hadoop.hbase.master.HMaster.checkInitialized(HMaster.java:2268)
        at org.apache.hadoop.hbase.master.MasterRpcServices.getT]]></description><category></category></item><item><title><![CDATA[centos 6.8 发送邮件]]></title><link>https://blog.csdn.net/Perfect_chen/article/details/103724215</link><guid>https://blog.csdn.net/Perfect_chen/article/details/103724215</guid><author>Perfect_chen</author><pubDate>Thu, 26 Dec 2019 23:46:46 +0800</pubDate><description><![CDATA[yum -y install mutt

vim /etc/Muttrc

设置发送方邮箱地址,及编码格式

如果不设置的话默认会使用主机名，会出现From: username@hostname.p ^B

报Bad IDN in "from": 'namenode.p���?' 的错误



set from=xxx@xxx.com

set charset=utf-8

set realna...]]></description><category></category></item><item><title><![CDATA[hive数据倾斜分析]]></title><link>https://blog.csdn.net/Perfect_chen/article/details/103663564</link><guid>https://blog.csdn.net/Perfect_chen/article/details/103663564</guid><author>Perfect_chen</author><pubDate>Mon, 23 Dec 2019 13:03:43 +0800</pubDate><description><![CDATA[关于mapreduce 两张表的join
1、map端join
 map端join用的是分布式文件缓存，将小文件缓存到maptask端，hive默认缓存文件大小为25M，
 以join字段作为key，其他字段作为value，保存到hashMap集合里面，然后和输入的一条数据记录进行join操作，
 得到join后的结果输出到缓存区进行分区排序操作。
 
2、reduce端的...]]></description><category></category></item><item><title><![CDATA[VMware NAT 模式，网关无法ping通 网关解决办法]]></title><link>https://blog.csdn.net/Perfect_chen/article/details/103654927</link><guid>https://blog.csdn.net/Perfect_chen/article/details/103654927</guid><author>Perfect_chen</author><pubDate>Sun, 22 Dec 2019 17:21:39 +0800</pubDate><description><![CDATA[首先windows端ip，子网掩码都已经配置好了，没有问题。



Vmware 端也配置好了



当从windows端ping虚拟机时发现超时，无法ping通，网关也无法ping通，从虚拟机端也一样的，由此可以得出，是网关出了问题，即是VMware没有获得网关的ip。

接下来查看windows 启动项配置

win+R,输入msconfig



勾选VMware NAT Service...]]></description><category></category></item><item><title><![CDATA[windows10 更新后VMware无法启动]]></title><link>https://blog.csdn.net/Perfect_chen/article/details/103654822</link><guid>https://blog.csdn.net/Perfect_chen/article/details/103654822</guid><author>Perfect_chen</author><pubDate>Sun, 22 Dec 2019 17:09:10 +0800</pubDate><description><![CDATA[更新到这个版本就可以用了，确实之前的windows版本有很多问题，不过这个版本bug都修复了，包括消息通知栏，日期栏等无法打开的问题都解决了，大家更新到这个版本吧，目前还没发现什么问题，感觉稳定性还不错



vm版本为



成功启动，之前版本
...]]></description><category></category></item><item><title><![CDATA[pc 端 TIM双击无法启动解决办法]]></title><link>https://blog.csdn.net/Perfect_chen/article/details/103654630</link><guid>https://blog.csdn.net/Perfect_chen/article/details/103654630</guid><author>Perfect_chen</author><pubDate>Sun, 22 Dec 2019 16:50:19 +0800</pubDate><description><![CDATA[一般为windows启动项没开启

window+R 输入msconfig



勾选QPCore service,重启解决
]]></description><category></category></item><item><title><![CDATA[如何解决sqlplus "/as sysdba " 提示 ORA-01031： insufficient privileges]]></title><link>https://blog.csdn.net/Perfect_chen/article/details/84445982</link><guid>https://blog.csdn.net/Perfect_chen/article/details/84445982</guid><author>Perfect_chen</author><pubDate>Sat, 24 Nov 2018 16:16:43 +0800</pubDate><description><![CDATA[出现该问题可能是你现在电脑登陆的用户不是你安装配置Oracle数据库时的用户，所以会出现这种没有权限的情况

那么如何解决呢？



解决的办法是通过命令行来把你电脑用户添加到ORA_DBA中去

下面看图解



这是我当前的用户名admin

下面我们来查看我们电脑的所有用户组，我当前用户是属于Administrators下的 



 

用命令添加你的用户进入ORA_DBA用户组就能登陆了...]]></description><category></category></item></channel></rss>