<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[FZH1213的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/FZH1213</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; FZH1213]]></copyright><item><title><![CDATA[什么是zookeeper]]></title><link>https://blog.youkuaiyun.com/FZH1213/article/details/103675210</link><guid>https://blog.youkuaiyun.com/FZH1213/article/details/103675210</guid><author>FZH1213</author><pubDate>Mon, 23 Dec 2019 23:33:33 +0800</pubDate><description><![CDATA[原文链接:https://mp.weixin.qq.com/s/Gs4rrF8wwRzF6EvyrF_o4A

]]></description><category></category></item><item><title><![CDATA[redis和zookeeper实现分布式锁的原理]]></title><link>https://blog.youkuaiyun.com/FZH1213/article/details/103674947</link><guid>https://blog.youkuaiyun.com/FZH1213/article/details/103674947</guid><author>FZH1213</author><pubDate>Mon, 23 Dec 2019 23:07:42 +0800</pubDate><description><![CDATA[redis分布式锁实现原理:https://mp.weixin.qq.com/s/8fdBKAyHZrfHmSajXT_dnA
zookeepre分布式锁实现原理:https://mp.weixin.qq.com/s/u8QDlrDj3Rl1YjY4TyKMCA

]]></description><category></category></item><item><title><![CDATA[并查集]]></title><link>https://blog.youkuaiyun.com/FZH1213/article/details/79748148</link><guid>https://blog.youkuaiyun.com/FZH1213/article/details/79748148</guid><author>FZH1213</author><pubDate>Thu, 29 Mar 2018 20:01:42 +0800</pubDate><description><![CDATA[原文转载自：https://blog.youkuaiyun.com/u013546077/article/details/64509038
]]></description><category></category></item><item><title><![CDATA[最长回文子串]]></title><link>https://blog.youkuaiyun.com/FZH1213/article/details/79594117</link><guid>https://blog.youkuaiyun.com/FZH1213/article/details/79594117</guid><author>FZH1213</author><pubDate>Sat, 17 Mar 2018 17:45:49 +0800</pubDate><description><![CDATA[转载自：点击打开链接/**
 * 
 * author 刘毅（Limer）
 * date   2017-02-25
 * mode   C++ 
 */
#include&amp;lt;iostream&amp;gt;  
#include&amp;lt;string.h&amp;gt;
#include&amp;lt;algorithm&amp;gt;  
using namespace std;

char s[1000];
char s...]]></description><category></category></item><item><title><![CDATA[快速幂取模]]></title><link>https://blog.youkuaiyun.com/FZH1213/article/details/79558600</link><guid>https://blog.youkuaiyun.com/FZH1213/article/details/79558600</guid><author>FZH1213</author><pubDate>Wed, 14 Mar 2018 18:32:48 +0800</pubDate><description><![CDATA[截图地址：点击打开链接]]></description><category></category></item><item><title><![CDATA[图的深度优先搜索]]></title><link>https://blog.youkuaiyun.com/FZH1213/article/details/78734460</link><guid>https://blog.youkuaiyun.com/FZH1213/article/details/78734460</guid><author>FZH1213</author><pubDate>Wed, 06 Dec 2017 19:56:15 +0800</pubDate><description><![CDATA[#include
#include
int lin[100][100];
int flag[1000];
int a;
void dfs(int s){
    int i;
    if(flag[s]==0){
        printf(" %d",s);
        flag[s]=1;
    }

    for(i=1;i<=a;i++){
        if(lin[s][]]></description><category></category></item></channel></rss>