<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[JuniorChestnut的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/JuniorChestnut</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; JuniorChestnut]]></copyright><item><title><![CDATA[i2c-test的使用-读写]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/154062130</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/154062130</guid><author>JuniorChestnut</author><pubDate>Wed, 29 Oct 2025 10:27:12 +0800</pubDate><description><![CDATA[这是一个I2C总线测试工具的使用说明文档。该工具支持多种I2C操作，包括设置总线号(-b)、主机地址(--sethost)、总线速度(--setspeed)、总线扫描(--scan)等核心功能，以及读写数据(-w/-r)、指定传输模式(-m)、连续测试(-f)等操作。文档提供了一个具体的使用示例，展示了如何通过两个命令分别实现向从机地址0x22写入0x96，然后从同一地址读取256字节数据的功能，并输出了详细的执行结果。该工具主要适用于I2C总线设备的调试和测试场景。]]></description><category></category></item><item><title><![CDATA[【ipmi-kcs通道】]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/154060731</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/154060731</guid><author>JuniorChestnut</author><pubDate>Wed, 29 Oct 2025 10:05:18 +0800</pubDate><description><![CDATA[ipmi kcs]]></description><category></category></item><item><title><![CDATA[【无标题】]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/149538774</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/149538774</guid><author>JuniorChestnut</author><pubDate>Tue, 22 Jul 2025 15:52:58 +0800</pubDate><description><![CDATA[PID 调速]]></description><category></category></item><item><title><![CDATA[I2C-Tools]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/146410585</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/146410585</guid><author>JuniorChestnut</author><pubDate>Fri, 21 Mar 2025 05:06:10 +0800</pubDate><description><![CDATA[i2c-tools]]></description><category></category></item><item><title><![CDATA[OS学习记录]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/143898928</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/143898928</guid><author>JuniorChestnut</author><pubDate>Wed, 20 Nov 2024 00:39:08 +0800</pubDate><description><![CDATA[‌‌Ubuntu系统‌]]></description><category></category></item><item><title><![CDATA[服务器如何编译c文件]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/129991411</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/129991411</guid><author>JuniorChestnut</author><pubDate>Thu, 06 Apr 2023 15:52:05 +0800</pubDate><description><![CDATA[转载：]]></description><category></category></item><item><title><![CDATA[【无标题】]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/129943295</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/129943295</guid><author>JuniorChestnut</author><pubDate>Tue, 04 Apr 2023 01:09:20 +0800</pubDate><description><![CDATA[更新Yum源]]></description><category></category></item><item><title><![CDATA[VS2017社区版许可证过期问题]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/126715536</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/126715536</guid><author>JuniorChestnut</author><pubDate>Mon, 05 Sep 2022 23:10:33 +0800</pubDate><description><![CDATA[VS2017社区版 许可证过期问题]]></description><category></category></item><item><title><![CDATA[配对t检验]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/121797293</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/121797293</guid><author>JuniorChestnut</author><pubDate>Wed, 08 Dec 2021 17:54:45 +0800</pubDate><description><![CDATA[waiting…

]]></description><category></category></item><item><title><![CDATA[未定义与 ‘double‘ 类型的输入参数相对应的函数]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/121504276</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/121504276</guid><author>JuniorChestnut</author><pubDate>Tue, 23 Nov 2021 22:11:19 +0800</pubDate><description><![CDATA[1.
【注】 一般出现这种错误，就是“你当前运行的脚本，找不到这个函数”；
		例如，脚本路径在‘A\code\’下，
			  脚本中调用的函数也在‘A\code\’下，
	    但是，你运行脚本的时候，是在其他的路径下；
2. 【解决问题】： 回到脚本所在文件夹下，然后点击‘运行’；
                 如果还不行，观察‘脚本’和‘脚本中调用的函数’ 是不
                 是在同一个文件夹下（确保脚本能够找到函数）。


...]]></description><category></category></item><item><title><![CDATA[Matlab常用读取文件和取行列]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/121170193</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/121170193</guid><author>JuniorChestnut</author><pubDate>Fri, 05 Nov 2021 20:30:59 +0800</pubDate><description><![CDATA[% 建议使用readmatrix，读取excel文件
M = readmatrix(path, 'Range','A10:I108716');

% 读取txt文件，直接使用importdata 或者txtread
data = importdata(file_path);

% 取数据的行列
example(: ,1:3)提取矩阵的1~3列
example(1:3, :)提取矩阵的1~3行


...]]></description><category></category></item><item><title><![CDATA[二叉树的后序遍历（C++迭代版）]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/120310179</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/120310179</guid><author>JuniorChestnut</author><pubDate>Wed, 15 Sep 2021 16:02:22 +0800</pubDate><description><![CDATA[* Definition for a binary tree node.
 struct TreeNode {
      int val;
      TreeNode *left;
      TreeNode *right;
      TreeNode() : val(0), left(nullptr), right(nullptr) {}
      TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
      TreeNode.]]></description><category></category></item><item><title><![CDATA[C语言-快速排序]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/120250346</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/120250346</guid><author>JuniorChestnut</author><pubDate>Sun, 12 Sep 2021 14:34:04 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
using namespace std;


// 1. 找基准， 双指针
// 2. 从右侧开始
// 3. 大于基准的放在右边，小于放左侧
// 4. 交换原数组基准处的值 和 arr[i] --循环结束 i==j
// 5. 递归处理 左侧和右侧
// 6. 写递归的基础条件，递归如何退出？

void Swap(int* a, int* b)
{
	int tmp = *a;
	*a = *b;
	*b = tmp;
}

void AQuickS]]></description><category></category></item><item><title><![CDATA[C语言-插入排序]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/120235903</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/120235903</guid><author>JuniorChestnut</author><pubDate>Sat, 11 Sep 2021 12:16:17 +0800</pubDate><description><![CDATA[#pragma once
#include &lt;iostream&gt;

void Swap(int*a, int* b)
{
	int tmp = *a;
	*a = *b;
	*b = tmp;
}

// 主要是j 和 j - 1 同步变化， 遇到大的直接 break;
void insertSort(int arr[], int N)
{
	for (int i = 1; i &lt; N; i++)
	{
		for (int j = i; j &gt; 0;) // i来了就代表j有了最大]]></description><category></category></item><item><title><![CDATA[堆排序（升序）]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/120219293</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/120219293</guid><author>JuniorChestnut</author><pubDate>Fri, 10 Sep 2021 12:00:55 +0800</pubDate><description><![CDATA[【注】： 此处没有设置哨兵
#pragma once
#include &lt;iostream&gt;
#include &lt;vector&gt;
using namespace std;

// 堆排序步骤： 
/*
	1. 把数组表示成完全二叉树......画出图（草纸上）
	2. 把完全二叉树调成最大堆或者最小堆
	3. 取根节点和最后一个叶节点 交换，删除根节点，重新调整为最大堆或者最小堆
*/
// 代码关键
/*
	1. 调整堆，从最后一个非叶节点开始： 下标为: 数组长度/2 -1
	2]]></description><category></category></item><item><title><![CDATA[map和unordered_map]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/120168845</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/120168845</guid><author>JuniorChestnut</author><pubDate>Tue, 07 Sep 2021 22:43:55 +0800</pubDate><description><![CDATA[一、map
1. 使用map 要先包含头文件 #include &lt;map&gt;;
2. map 内部的实现原理：
	map内部实现了一个红黑树，该结构具有自动排序的功能，因此map内部的所有元素都是有序的，
	红黑树的每一个节点都代表着map的一个元素，
	因此，对于map进行的查找，删除，添加等一系列的操作都相当于是对红黑树进行这样的操作，
	故红黑树的效率决定了map的效率。
3. 优点：
	有序性，这是map结构最大的优点，其元素的有序性在很多应用中都会简化很多的操作。
	红黑树，内部实现一个]]></description><category></category></item><item><title><![CDATA[Ubantu创建共享文件夹]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/119887629</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/119887629</guid><author>JuniorChestnut</author><pubDate>Tue, 24 Aug 2021 13:10:10 +0800</pubDate><description><![CDATA[比较新的Ubantu 可以直接复制，本文Ubantu 16.04v
找到《虚拟机》–&gt; 《设置》–&gt; 常规—&gt; 启用共享文件
添加共享文件夹，浏览windows下的文件夹作为路径

cd /mnt 
ls 
cd /hgfs
ls
应该可以看到你共享的文件夹


...]]></description><category></category></item><item><title><![CDATA[编程一定要注意！！！]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/119547726</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/119547726</guid><author>JuniorChestnut</author><pubDate>Mon, 09 Aug 2021 21:44:35 +0800</pubDate><description><![CDATA[想开头：
想结尾：
想中间：
想特殊！！！！


]]></description><category></category></item><item><title><![CDATA[最小生成树]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/119540273</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/119540273</guid><author>JuniorChestnut</author><pubDate>Mon, 09 Aug 2021 16:07:10 +0800</pubDate><description><![CDATA[Dijkstra算法是用来解决： 有权图的单源最短路径问题
Prim算法是：根据网图来创造一个“最小生成树”。


]]></description><category></category></item><item><title><![CDATA[深度优先搜索（DFS）和广度优先搜索（BFS）]]></title><link>https://blog.youkuaiyun.com/JuniorChestnut/article/details/119464963</link><guid>https://blog.youkuaiyun.com/JuniorChestnut/article/details/119464963</guid><author>JuniorChestnut</author><pubDate>Fri, 06 Aug 2021 23:14:16 +0800</pubDate><description><![CDATA[都是遍历图，为什么需要两种搜索方式？
答：因为两种搜索的路径不一样…

例子：

如上图，在使用深度优先遍历时，假定剑客从左上角进来，到绿色的框格里离开。黑框视为阻隔，白框视为联通，即存在边(Edge)。对于深度优先遍历来说，你要给他规定一种规律，让他一条路走到底，执行递归。规定：剑客会以自己为中心，以上侧为第一个，顺时针，遍历周围的8个格子。结果如下：

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