<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Chocological7的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Chocological7</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Chocological7]]></copyright><item><title><![CDATA[fabric 2.3 创建通道问题]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/129089199</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/129089199</guid><author>Chocological7</author><pubDate>Fri, 17 Feb 2023 18:30:36 +0800</pubDate><description><![CDATA[解决fabric v2.3创建通道时遇到的问题]]></description><category></category></item><item><title><![CDATA[VMware ubuntu于windows共享文件夹空了]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/128403283</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/128403283</guid><author>Chocological7</author><pubDate>Wed, 21 Dec 2022 23:20:48 +0800</pubDate><description><![CDATA[VMware共享文件夹空了]]></description><category></category></item><item><title><![CDATA[hadoop开启NameNode和DataNode守护进程，发现Permission denied]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/127556277</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/127556277</guid><author>Chocological7</author><pubDate>Thu, 27 Oct 2022 17:00:24 +0800</pubDate><description><![CDATA[可能是之前配置SSH无密码登录时出现错误，需要重新进行SSH链接公钥认证。]]></description><category></category></item><item><title><![CDATA[AttributeError: module ‘backend_interagg‘ has no attribute ‘FigureCanvas‘. Did you mean: ‘FigureCanv]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/127191215</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/127191215</guid><author>Chocological7</author><pubDate>Fri, 07 Oct 2022 09:57:41 +0800</pubDate><description><![CDATA[报错canvas_class = backend_mod.FigureCanvas
AttributeError: module 'backend_interagg' has no attribute 'FigureCanvas'. Did you mean: 'FigureCanvasAgg'?]]></description><category></category></item><item><title><![CDATA[搭建fisco时问题]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/127049363</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/127049363</guid><author>Chocological7</author><pubDate>Mon, 26 Sep 2022 10:47:56 +0800</pubDate><description><![CDATA[搭建fisco出现的问题]]></description><category></category></item><item><title><![CDATA[反监控之winrdlv3.exe]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/126323678</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/126323678</guid><author>Chocological7</author><pubDate>Sat, 13 Aug 2022 20:00:39 +0800</pubDate><description><![CDATA[反监控]]></description><category></category></item><item><title><![CDATA[leetcode 算法基础 day6 广搜/深搜]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/126240193</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/126240193</guid><author>Chocological7</author><pubDate>Tue, 09 Aug 2022 11:30:07 +0800</pubDate><description><![CDATA[给你一个由 '1'（陆地）和 '0'（水）组成的的二维网格，请你计算网格中岛屿的数量。岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。此外，你可以假设该网格的四条边均被水包围。避免重复遍历：在所有值为1的陆地格子上做DFS遍历。每走过一个陆地格子 ，就把格子的值改为2，当我们遇到2时，就知道这是遍历过的格子了。所以每个格子可能取3个值：0——海洋格子               1——陆地格子（未遍历过）    2——陆地格子（已遍历过）...]]></description><category></category></item><item><title><![CDATA[leetcode算法基础 day7 广搜/深搜]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/126220645</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/126220645</guid><author>Chocological7</author><pubDate>Mon, 08 Aug 2022 10:49:39 +0800</pubDate><description><![CDATA[广搜深搜]]></description><category></category></item><item><title><![CDATA[leetcode算法基础 day5 滑动窗口]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/126195796</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/126195796</guid><author>Chocological7</author><pubDate>Sat, 06 Aug 2022 17:13:21 +0800</pubDate><description><![CDATA[滑动窗口]]></description><category></category></item><item><title><![CDATA[leet 算法基础 day4 双指针]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/126189013</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/126189013</guid><author>Chocological7</author><pubDate>Sat, 06 Aug 2022 15:22:25 +0800</pubDate><description><![CDATA[双指针]]></description><category></category></item><item><title><![CDATA[leetcode 算法基础 day3]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/126129688</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/126129688</guid><author>Chocological7</author><pubDate>Tue, 02 Aug 2022 21:11:50 +0800</pubDate><description><![CDATA[记得再看]]></description><category></category></item><item><title><![CDATA[leetcode 算法基础 day2]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/126108573</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/126108573</guid><author>Chocological7</author><pubDate>Mon, 01 Aug 2022 21:20:14 +0800</pubDate><description><![CDATA[还是二分]]></description><category></category></item><item><title><![CDATA[leetcode 算法基础day1]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/126081402</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/126081402</guid><author>Chocological7</author><pubDate>Sun, 31 Jul 2022 15:32:49 +0800</pubDate><description><![CDATA[二分查找]]></description><category></category></item><item><title><![CDATA[LeetCode217.存在重复元素]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/124537467</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/124537467</guid><author>Chocological7</author><pubDate>Mon, 02 May 2022 12:30:22 +0800</pubDate><description><![CDATA[给你一个整数数组 nums 。如果任一值在数组中出现 至少两次 ，返回 true ；如果数组中每个元素互不相同，返回 false 。


示例 1：

输入：nums = [1,2,3,1]
输出：true
示例 2：

输入：nums = [1,2,3,4]
输出：false
示例3：

输入：nums = [1,1,1,3,3,4,3,2,4,2]
输出：true

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/contains-duplic..]]></description><category></category></item><item><title><![CDATA[Spring MVC各层之间的关系图]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/123504022</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/123504022</guid><author>Chocological7</author><pubDate>Tue, 15 Mar 2022 15:36:17 +0800</pubDate><description><![CDATA[转自SpringMVC各层之间的关系图 - HankBernstein - 博客园
]]></description><category></category></item><item><title><![CDATA[力扣 189. 轮转数组]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/123433814</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/123433814</guid><author>Chocological7</author><pubDate>Fri, 11 Mar 2022 21:17:33 +0800</pubDate><description><![CDATA[问题描述：

给你一个数组，将数组中的元素向右轮转 k 个位置，其中 k 是非负数。



示例 1:

输入: nums = [1,2,3,4,5,6,7], k = 3
输出: [5,6,7,1,2,3,4]
解释:
向右轮转 1 步: [7,1,2,3,4,5,6]
向右轮转 2 步: [6,7,1,2,3,4,5]
向右轮转 3 步: [5,6,7,1,2,3,4]
示例2:

输入：nums = [-1,-100,3,99], k = 2
输出：[3,99,-1,-100]
解释:
向右轮转 ..]]></description><category></category></item><item><title><![CDATA[NUST 2009-8]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/122910847</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/122910847</guid><author>Chocological7</author><pubDate>Mon, 14 Feb 2022 17:21:22 +0800</pubDate><description><![CDATA[知识补充

1.int main(int argc,char* argv[])

argc是命令行总的参数个数 

argv[]是argc个参数，其中第0个参数是程序的全名，以后的参数是命令行后面跟的用户输入的参数
]]></description><category></category></item><item><title><![CDATA[输入字符串，统计单词个数]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/122898115</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/122898115</guid><author>Chocological7</author><pubDate>Sat, 12 Feb 2022 16:49:10 +0800</pubDate><description><![CDATA[结合C++中的 size_t find_first_not_of (const char* s, size_t pos, size_t n) const; 方法和 size_t find_first_of (const char* s, size_t pos, size_t n) const;来统计字符串中单词的个数。

代码


#include &lt;iostream&gt;
#include &lt;vector&gt;
#include &lt;string&gt;

// 计算一个字符串中有多少]]></description><category></category></item><item><title><![CDATA[递归-汉诺塔]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/122895749</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/122895749</guid><author>Chocological7</author><pubDate>Sat, 12 Feb 2022 15:06:37 +0800</pubDate><description><![CDATA[解题步骤：

第一步：

把n-1个模块 从塔 A 移动到塔 B

把第n个模块 从塔 A 移动到塔 C

第二步

把n-1个模块 从塔 B 移动到塔 C

代码：


#include&lt;bits/stdc++.h&gt;

using namespace std;

void hannoi(int n, char A, char B, char C)// 把A盘里面的圆圈转移到C盘里面【A--C】。
{
    if (n == 1)
    {
        cout &lt;&lt; "移动]]></description><category></category></item><item><title><![CDATA[连续、链接、索引分配题目]]></title><link>https://blog.youkuaiyun.com/Chocological7/article/details/121911373</link><guid>https://blog.youkuaiyun.com/Chocological7/article/details/121911373</guid><author>Chocological7</author><pubDate>Mon, 13 Dec 2021 18:13:57 +0800</pubDate><description><![CDATA[https://tiku.baidu.com/view/5d91ffdfb8f3f90f76c66137ee06eff9aef849ca

]]></description><category></category></item></channel></rss>