<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Stack_0的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Stack_0</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Stack_0]]></copyright><item><title><![CDATA[图图--唐僧过女儿国]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/139970090</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/139970090</guid><author>Stack_0</author><pubDate>Tue, 25 Jun 2024 21:31:03 +0800</pubDate><description><![CDATA[【代码】图图--唐僧过女儿国。]]></description><category></category></item><item><title><![CDATA[C/C++ 各种功能学习笔记]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/130661232</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/130661232</guid><author>Stack_0</author><pubDate>Sat, 13 May 2023 22:10:07 +0800</pubDate><description><![CDATA[当函数的参数类型为char*时，他将无法被一个const char*类型的值所赋值。]]></description><category></category></item><item><title><![CDATA[Mysql数据库 各种功能学习笔记]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/130550794</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/130550794</guid><author>Stack_0</author><pubDate>Mon, 08 May 2023 02:35:26 +0800</pubDate><description><![CDATA[基本教学：1.使用命令创建数据库2.使用use命令打开数据库3.使用命令删除数据库4.使用查询所有数据库5.使用查询库中的所有数据表需要注意的问题：1. 数据库名可以用中文也可以用英文2.create database也可以写成CREATE DATABASE，大小写不限制3.每一句命令后面都要加上分号，就像说话后要带上句号一样。]]></description><category></category></item><item><title><![CDATA[Qt 各种功能学习笔记]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/130547839</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/130547839</guid><author>Stack_0</author><pubDate>Mon, 08 May 2023 00:22:08 +0800</pubDate><description><![CDATA[Qt链接MySQL的代码编写：1.首先在pro文件中要加入sql，例如：QT += core gui sql2.然后要包含头文件 、]]></description><category></category></item><item><title><![CDATA[Windows小知识（持续更新）]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/129045866</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/129045866</guid><author>Stack_0</author><pubDate>Wed, 15 Feb 2023 16:26:43 +0800</pubDate><description><![CDATA[可以让程序暂停一下之后按任意键继续，避免程序一闪而过。]]></description><category></category></item><item><title><![CDATA[字符串操作及其函数（会持续更新）]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/129043521</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/129043521</guid><author>Stack_0</author><pubDate>Wed, 15 Feb 2023 16:05:47 +0800</pubDate><description><![CDATA[该函数以无符号char强制转换为int的形式返回读取的字符，如果到达文件末尾或出现读错，则返回EOF。str1=str2时，返回零；strcmp比较字符串大小的方法是：从左到右，依次对字母的ASCII码的大小进行比较，遇到不一样的字符或'\0'结束。是将一个字符串复制到另一块空间地址中 的函数，‘\0’是停止拷贝的终止条件，同时也会将 '\0' 也复制到目标空间。这个\t是可以更改的，改成\n则为直到读到\n为止。当函数的参数类型为char*时，他将无法被一个const char*类型的值所赋值。]]></description><category></category></item><item><title><![CDATA[Python实现微信自动回复]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/128398081</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/128398081</guid><author>Stack_0</author><pubDate>Wed, 21 Dec 2022 15:48:45 +0800</pubDate><description><![CDATA[Python实现微信自动回复]]></description><category></category></item><item><title><![CDATA[使用Qt链接MySql数据库]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/127712658</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/127712658</guid><author>Stack_0</author><pubDate>Sun, 06 Nov 2022 16:27:43 +0800</pubDate><description><![CDATA[Qt链接MySql数据库]]></description><category></category></item><item><title><![CDATA[字符串转换整数]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/127359380</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/127359380</guid><author>Stack_0</author><pubDate>Mon, 17 Oct 2022 10:59:16 +0800</pubDate><description><![CDATA[字符串转换整数]]></description><category></category></item><item><title><![CDATA[字形变换(字符串)]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/122733188</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/122733188</guid><author>Stack_0</author><pubDate>Fri, 28 Jan 2022 16:27:50 +0800</pubDate><description><![CDATA[题目来自力扣：

做之前我必须吐槽几句，这是我写过最难的题了！！！





下面是我的代码

别问为什么没有注释，我打代码从来不带注释，看得懂的才是同路人




char* convert(char* s, int numRows)
{
	int sLenth = strlen(s);
	printf("字符串的长度为：%d\n", sLenth);

	char* output = (char*)malloc(1000);
	memset(output, 0, 1000);
	int subscrip]]></description><category></category></item><item><title><![CDATA[最长回文子串]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/122704865</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/122704865</guid><author>Stack_0</author><pubDate>Wed, 26 Jan 2022 16:45:36 +0800</pubDate><description><![CDATA[题目来自力扣：

我实现代码如下：


int judgmentString(char* s, int start, int sLenth)
{
	char sValidAtion[1000] = "\0";
	int count = 0;
	for (int i = start; i &lt; sLenth; i++)
	{
		sValidAtion[count++] = s[i];
	}
	count = start + sLenth - 1;
	for (int i = start; i &lt;.]]></description><category></category></item><item><title><![CDATA[无重复字符的最长子串]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/122700369</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/122700369</guid><author>Stack_0</author><pubDate>Wed, 26 Jan 2022 14:01:07 +0800</pubDate><description><![CDATA[题目来自力扣：



我实现功能代码如下：


int count = 0;
	int recordCount = 0;
	int digits = 0;
	int dcount = 0;
	char num[2] = "";
	char* s = (char*)malloc(5 * 10000);
	char* detection = (char*)malloc(5 * 10000);
	memset(s, 0,5* 10000);
	memset(detection, 0, 5 * 10000);
	a]]></description><category></category></item><item><title><![CDATA[力扣两数相加(链表)]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/122653130</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/122653130</guid><author>Stack_0</author><pubDate>Sun, 23 Jan 2022 16:43:24 +0800</pubDate><description><![CDATA[1.我们需要创建两个链表


typedef struct linkedList
{
	int data;
	struct linkedList* next;
}VARIABLE,*POINTER;

//创建链表头
POINTER createListHead()
{
	POINTER list = (POINTER)malloc(sizeof(VARIABLE));
	assert(list);
	list-&gt;data = 0;
	list-&gt;next = NULL;
	return l..]]></description><category></category></item><item><title><![CDATA[指针的运用]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/122562587</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/122562587</guid><author>Stack_0</author><pubDate>Tue, 18 Jan 2022 22:06:45 +0800</pubDate><description><![CDATA[指针的基础使用方式，指针、函数指针、指针函数、函数指针为参数、万能指针。]]></description><category></category></item><item><title><![CDATA[这是开挂吗？不，这是坚持于努力]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/120878910</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/120878910</guid><author>Stack_0</author><pubDate>Thu, 21 Oct 2021 08:25:08 +0800</pubDate><description><![CDATA[可能是我见识少，我长这么大，第一次看到有人可以写一个小题目将堆空间写满的

本图来源于他处，若有侵权请联系删除
]]></description><category></category></item><item><title><![CDATA[求1~n内所有的孪生素数，孪生素数值相差2的素数]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/120628817</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/120628817</guid><author>Stack_0</author><pubDate>Wed, 06 Oct 2021 20:06:36 +0800</pubDate><description><![CDATA[思路：先判断素数并记录，之后在下一个素数的时候再相减，等于2贼输出


int prime = 0;  //目前素数
int lastPrime = 1;  //上一个素数
int n = 0;
printf("请用户输入最大值：");
scanf("%d", &amp;n);
for (int i = 3; i &lt; n; i++)
{
	int juDge = 0;  //判断是否素数
	for (int j = 2; j &lt; i; j++)
	{
		if (i % j == 0)
		{
]]></description><category></category></item><item><title><![CDATA[有效括号{}()[]]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/120518874</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/120518874</guid><author>Stack_0</author><pubDate>Tue, 28 Sep 2021 14:12:36 +0800</pubDate><description><![CDATA[（该图截于力扣）题目要求：



感想：这题目看的出很无厘头，我一开始触碰的时候是不知从何下手的，于是我就通过单纯分开功能实现，不求代码完美只求能跑哈哈哈

思路：1.检测字符串第一个是否是 }、)、]等字符串，是的话直接返回0结束进程

     2.在检测一个括号里面相隔的位数


...]]></description><category></category></item><item><title><![CDATA[求最长公共前缀]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/120500957</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/120500957</guid><author>Stack_0</author><pubDate>Mon, 27 Sep 2021 08:45:49 +0800</pubDate><description><![CDATA[思路：先求最小的字符串长度和小标，之后拿字符串比较函数一个个字符和前面的比较，记下第几个不返回零，之后再去比较后面的字符串重复步骤，最后用字符串截取代表最长公共前缀的变量值



废话不多说，上实现代码：

第一部分：让用户输入字符串以达到比较效果


char** str = (char**)malloc(sizeof(char*) * 201);
	for (int i = 0; i &lt; 201; i++)
	{
		str[i] = (char*)malloc(sizeof(char) * 2.]]></description><category></category></item><item><title><![CDATA[新人报道偏]]></title><link>https://blog.youkuaiyun.com/Stack_0/article/details/120498159</link><guid>https://blog.youkuaiyun.com/Stack_0/article/details/120498159</guid><author>Stack_0</author><pubDate>Sun, 26 Sep 2021 22:05:32 +0800</pubDate><description><![CDATA[编程小白每天分享笔记和心得
]]></description><category></category></item></channel></rss>