<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Win_Xin的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Win_Xin</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Win_Xin]]></copyright><item><title><![CDATA[计算机视觉传统图像处理库opencv的使用]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/132667491</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/132667491</guid><author>Win_Xin</author><pubDate>Mon, 04 Sep 2023 13:48:50 +0800</pubDate><description><![CDATA[AI必备技能-OpenCV基础讲解_opencv ai_吃猫的鱼python的博客-优快云博客计算机视觉-OpenCV入门讲解_吃猫的鱼python的博客-优快云博客。]]></description><category></category></item><item><title><![CDATA[stable diffusion安装包和超火使用文档，数字人制作网址]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/132280570</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/132280570</guid><author>Win_Xin</author><pubDate>Mon, 14 Aug 2023 18:07:02 +0800</pubDate><description><![CDATA[ai，stable diffusion,数字人]]></description><category></category></item><item><title><![CDATA[数据结构与算法 第11部分：排序]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/104636957</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/104636957</guid><author>Win_Xin</author><pubDate>Tue, 03 Mar 2020 17:28:07 +0800</pubDate><description><![CDATA[1：直接插入排序

算法步骤：
1)设待排度的记录存储在数组r[1...n]中，可以把第一个记录r[1]看作一个有序序列。
2）依次将r[i]（i = 2，…，n)插入到已经排好序的序列r[1..i - 1]中，并保持有序性。


void StraightInsertSort(int r[],int n)  //直接插入排序
{
	for (int nIndex = 2; nIndex &lt;...]]></description><category></category></item><item><title><![CDATA[数据结构与算法 第10部分：平衡二叉树]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/104634545</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/104634545</guid><author>Win_Xin</author><pubDate>Tue, 03 Mar 2020 16:07:11 +0800</pubDate><description><![CDATA[1:平衡二叉树定义


typedef struct AVLNode{
   int data;
   int height;
   struct AVLNode *lchild;
   struct AVLNode *rchild;
}*AVLTree;

2：删除树


AVLTree Empty(AVLTree &amp;T)//删除树
{
	if (nullptr == T)
	{
		r...]]></description><category></category></item><item><title><![CDATA[数据结构与算法 第09部分：二叉搜索树]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/104634302</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/104634302</guid><author>Win_Xin</author><pubDate>Tue, 03 Mar 2020 15:57:57 +0800</pubDate><description><![CDATA[1：二叉排序树结点定义


#define ENDFLAG -1
typedef int ElemType;

typedef struct BSTNode{
	ElemType data;	//结点数据域
	BSTNode *lchild,*rchild;	//左右孩子指针
}BSTNode,*BSTree;

2：二叉排序树的递归查找


BSTree SearchBST(BSTree T,E...]]></description><category></category></item><item><title><![CDATA[数据结构与算法 第08部分：查找]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/104633123</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/104633123</guid><author>Win_Xin</author><pubDate>Tue, 03 Mar 2020 15:12:13 +0800</pubDate><description><![CDATA[1：顺序查找


int SqSearch(int r[],int n,int x)//顺序查找
{
	for (int nIndex = 0; nIndex &lt; n; nIndex++) //要判断i是否超过范围n
	{
		if (r[nIndex] == x) //r[i]和x比较
		{
			return nIndex;//返回下标
		}
	}        
    retur...]]></description><category></category></item><item><title><![CDATA[数据结构与算法 第07部分：图的存储（邻接表）]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/104631868</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/104631868</guid><author>Win_Xin</author><pubDate>Tue, 03 Mar 2020 14:24:43 +0800</pubDate><description><![CDATA[1：创建有向图的邻接表（定义）


const int MaxVnum=100;//顶点数最大值

typedef char VexType;//顶点的数据类型为字符型
typedef struct AdjNode{ //定义邻接点类型
	int v; //邻接点下标
	struct AdjNode *next; //指向下一个邻接点
}AdjNode;

typedef struct VexNo...]]></description><category></category></item><item><title><![CDATA[数据结构与算法 第07部分：图的存储（邻接矩阵）]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/104631459</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/104631459</guid><author>Win_Xin</author><pubDate>Tue, 03 Mar 2020 14:04:50 +0800</pubDate><description><![CDATA[1：邻接矩阵创建无向图（定义）


#define MaxVnum 100  //顶点数最大值
typedef char VexType;  //顶点的数据类型，根据需要定义
typedef int EdgeType;  //边上权值的数据类型，若不带权值的图，则为0或1
typedef struct{
	VexType Vex[MaxVnum];
	EdgeType Edge[MaxVnum][...]]></description><category></category></item><item><title><![CDATA[数据结构与算法 第06部分：二叉树]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/104612166</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/104612166</guid><author>Win_Xin</author><pubDate>Mon, 02 Mar 2020 15:13:51 +0800</pubDate><description><![CDATA[1：定义二叉树存储结构


typedef struct Bnode	/*定义二叉树存储结构*/
{
	char data;
	struct Bnode *lchild,*rchild;
}Bnode,*Btree;

2：按先序次序输入二叉树中结点的值（一个字符），创建二叉链表表示的二叉树T


//按先序次序输入二叉树中结点的值（一个字符），创建二叉链表表示的二叉树T
void Createt...]]></description><category></category></item><item><title><![CDATA[数据结构与算法 第04部分：字符串]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/104611835</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/104611835</guid><author>Win_Xin</author><pubDate>Mon, 02 Mar 2020 14:57:06 +0800</pubDate><description><![CDATA[1:求子串：暴力穷举(Brute Force)

模式匹配：子串的定位运算称为串的模式匹配或串匹配。
假设有两个串S，T，设S为主串"asfheiufhre"，T为子串"eiu".
在主串S中查找与模式T相匹配的子串，如果查找成功，返回匹配的子串第一个字符在主串中的位置。


//最笨的办法就是穷举所有S的所有子串，判断是否与r匹配。该算法称为BF（Brute Force)
int BF(stri...]]></description><category></category></item><item><title><![CDATA[数据结构与算法 第03部分：栈与队列（队列）]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/104609919</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/104609919</guid><author>Win_Xin</author><pubDate>Mon, 02 Mar 2020 13:26:03 +0800</pubDate><description><![CDATA[1：队列定义


#define Maxsize 100

typedef  struct SqQueue{
  int *pBase; //基地址
  int nFront,nRear; //头指针,尾指针
}SqQueue;

2：循环队列的初始化


//循环队列的初始化
bool InitQueue(SqQueue &amp;Q)//注意使用引用参数，否则出了函数，其改变无效
{
	Q.p...]]></description><category></category></item><item><title><![CDATA[数据结构与算法 第03部分：栈与队列（栈）]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/104609752</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/104609752</guid><author>Win_Xin</author><pubDate>Mon, 02 Mar 2020 13:15:22 +0800</pubDate><description><![CDATA[1：栈定义


#define Maxsize 100  //预先分配空间，这个数值根据实际需要预估确定；

typedef struct SqStack {
	int *pBase; //栈底指针
	int *pTop; //栈顶指针
}SqStack;

2：构造一个空栈S


bool InitStack(SqStack &amp;S) //构造一个空栈S
{
	S.pBase = new ...]]></description><category></category></item><item><title><![CDATA[数据结构与算法 第02部分：线性表]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/104606578</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/104606578</guid><author>Win_Xin</author><pubDate>Mon, 02 Mar 2020 10:42:28 +0800</pubDate><description><![CDATA[1:结点定义


typedef struct LNode {
	int data; //结点的数据域
	struct LNode *next; //结点的指针域
}LNode, *LinkList; //LinkList为指向结构体LNode的指针类型



2：构造一个新的结点


bool InitList_L(LinkList &amp;LNew，int nData = 0)//构造一个新...]]></description><category></category></item><item><title><![CDATA[数据结构与算法 第01部分：算法基础]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/104606074</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/104606074</guid><author>Win_Xin</author><pubDate>Mon, 02 Mar 2020 10:10:42 +0800</pubDate><description><![CDATA[1:n的阶乘


long long fac(int n)
{
	if (n &lt; 0)
	{
		return -1;
	}   
	if (n == 0 || n == 1)
	{
		return 1;
	}
	return n * fac(n - 1);           
}

2：斐波那契数列


long long fib1(int n)
{
	if (n &lt; 1)
	{...]]></description><category></category></item><item><title><![CDATA[李宁老师视频笔记]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/103799808</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/103799808</guid><author>Win_Xin</author><pubDate>Thu, 02 Jan 2020 10:13:44 +0800</pubDate><description><![CDATA[#include &lt;sstream&gt; 
	string getName()
	{
		string strTmp = "hdsu";
		stringstream str;
		str &lt;&lt; "hello" &lt;&lt; strTmp;
		return str.str();
	}


]]></description><category></category></item><item><title><![CDATA[获取字串的字节数量]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/100705920</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/100705920</guid><author>Win_Xin</author><pubDate>Tue, 10 Sep 2019 17:32:00 +0800</pubDate><description><![CDATA[CString text = _T("中国12ab");
	
	
	int len1 = text.GetLength();//获取的是字符数量，值为 6
	
	
	int len2 = CStringA(text).GetLength();//获取的是字节数量，值为 8
	
]]></description><category></category></item><item><title><![CDATA[windows客户端开发--改变visual studio配色方案]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/90409278</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/90409278</guid><author>Win_Xin</author><pubDate>Tue, 21 May 2019 16:19:31 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/wangshubo1989/article/details/51108581

链接：https://pan.baidu.com/s/1YKHVi2WfgpK1_0eOkinyuA
提取码：6jt9
复制这段内容后打开百度网盘手机App，操作更方便哦
...]]></description><category></category></item><item><title><![CDATA[visual assist x破解版的使用]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/90407807</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/90407807</guid><author>Win_Xin</author><pubDate>Tue, 21 May 2019 15:26:24 +0800</pubDate><description><![CDATA[visual assist x破解版：网盘链接：

https://pan.baidu.com/s/1FtpBsVgAjbRmgPhABY47xQ密码：3qov

破解教程：

1、软件下载解压完成后，点击VA_X_Setup2223打开软件安装包，软件会自动识别你电脑中的Microsoft Visual Studio版本，点击Install开始安装软件。

2、安装完成。Installatio...]]></description><category></category></item><item><title><![CDATA[技术备份整理]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/85992248</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/85992248</guid><author>Win_Xin</author><pubDate>Mon, 07 Jan 2019 11:26:20 +0800</pubDate><description><![CDATA[
1:小数点位数不能超过2
double dPrice = 5.677f;
stringstream streamPrice;  
streamPrice &amp;lt;&amp;lt; fixed &amp;lt;&amp;lt; setprecision(2) &amp;lt;&amp;lt; dPrice;  
string strPrice = streamPrice.str();

2:int转string
stringstream...]]></description><category></category></item><item><title><![CDATA[字符串操作（连接、查找、截断、反转、大小写转换）]]></title><link>https://blog.youkuaiyun.com/Win_Xin/article/details/80938405</link><guid>https://blog.youkuaiyun.com/Win_Xin/article/details/80938405</guid><author>Win_Xin</author><pubDate>Fri, 06 Jul 2018 11:29:24 +0800</pubDate><description><![CDATA[1：字符串连接

string strSample1(&quot;Hello&quot;);

string strSample2(&quot;String!&quot;);

string strSample3(&quot;strSample3&quot;);

strSample1+= strSample2;

strSample1.append(strSample3);

2：字符串查找

string strSample(&quot;Good dayStri...]]></description><category></category></item></channel></rss>