<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[2301_80709869的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/2301_80709869</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; 2301_80709869]]></copyright><item><title><![CDATA[HTML添加文字]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/142077591</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/142077591</guid><author>2301_80709869</author><pubDate>Tue, 10 Sep 2024 08:47:46 +0800</pubDate><description><![CDATA[h1> - <h6> 标签可定义标题。<h1>定义最大的标题。<h6>定义最小的标题。用来规定文本的字体、字体颜色和字体尺寸。]]></description><category></category></item><item><title><![CDATA[C语言基本概念]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/140295762</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/140295762</guid><author>2301_80709869</author><pubDate>Wed, 10 Jul 2024 12:07:37 +0800</pubDate><description><![CDATA[1.人与人之间2.人与计算机之间例如在计算机语言中。]]></description><category></category></item><item><title><![CDATA[数据结构：旋转数组]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/139065692</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/139065692</guid><author>2301_80709869</author><pubDate>Sun, 09 Jun 2024 17:32:21 +0800</pubDate><description><![CDATA[时间复杂度：O（N） ，空间复杂度：O（N）时间复杂度：O（N），空间复杂度：O（1）]]></description><category></category></item><item><title><![CDATA[栈和队列高频面试题]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/139414999</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/139414999</guid><author>2301_80709869</author><pubDate>Sun, 09 Jun 2024 11:20:37 +0800</pubDate><description><![CDATA[给定一个只包括 ‘(’，’)’，’{’，’}’，’[’，’]’ 的字符串 s ，判断字符串是否有效。有效字符串需满足：1.左括号必须用相同类型的右括号闭合。2.左括号必须以正确的顺序闭合。要求空间复杂度为：O(n）思路：栈的后进先出的规则（后入栈的前括号将优先与先出现的后括号相匹配）]]></description><category></category></item><item><title><![CDATA[链表（2）反转链表]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/139360862</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/139360862</guid><author>2301_80709869</author><pubDate>Fri, 31 May 2024 21:43:49 +0800</pubDate><description><![CDATA[此时发现了遍历链表的终止条件和需要返回的新的头指针，即当。]]></description><category></category></item><item><title><![CDATA[数据结构：堆的两种算法、堆的基本功能实现]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/139102976</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/139102976</guid><author>2301_80709869</author><pubDate>Tue, 28 May 2024 17:12:08 +0800</pubDate><description><![CDATA[如果有一个关键码的集合K={k0,k1,k2,…,kn-1}，把它的所有元素按完全二叉树的顺序存储方式存储在一个一维数组中，并满足ki=k2i+2），其中i=0,1,2,…，则称该集合为堆。：将根结点最小的堆叫做小堆，也叫最小堆或小根堆。：将根结点最大的堆叫做大堆，也叫最大堆或大根堆。]]></description><category></category></item><item><title><![CDATA[链表（1）移除链表元素]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/139237244</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/139237244</guid><author>2301_80709869</author><pubDate>Mon, 27 May 2024 16:05:41 +0800</pubDate><description><![CDATA[当排查到最后一个结点时，cur指向最后一个结点，next指针指向该节点指向的位置，即NULL。我们用上面常规情况的方法对其进行分析，发现常规情况的思路适用于这种特殊情况。并且发现遍历的终止条件，就是当cur为NULL的时候遍历停止。]]></description><category></category></item><item><title><![CDATA[数据结构：带头双向循环链表]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/139148170</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/139148170</guid><author>2301_80709869</author><pubDate>Thu, 23 May 2024 19:08:35 +0800</pubDate><description><![CDATA[前面说到，链表的结构一共有8中：带头单向循环、带头单向非循环、带头双向循环、带头双向非循环、无头单向循环、无头单向非循环、无头双向循环、无头双向非循环。在这8中结构中，我们只挑两种来剖析：即无头单向非循环和带头双向循环。：结构简单，一般不会用来存储数据。实际上是作为其他数据结构的子结构，入哈希桶、图的链接表等等。此外，这种结构在笔试面试中出现很多。：结构最复杂，一般用在单独存储数据。实际使用的链表数据都是带头双向循环链表。]]></description><category></category></item><item><title><![CDATA[数据结构：单链表专题]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/138413872</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/138413872</guid><author>2301_80709869</author><pubDate>Thu, 23 May 2024 14:58:00 +0800</pubDate><description><![CDATA[单链表的英文：single linked list，简称SLT}SListNode;]]></description><category></category></item><item><title><![CDATA[针对鼠标向下滚动但时不时向上跳的问题]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/139145693</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/139145693</guid><author>2301_80709869</author><pubDate>Thu, 23 May 2024 13:51:34 +0800</pubDate><description><![CDATA[鼠标内部存在了脏东西，鼠标失灵。不是电脑的设置问题。]]></description><category></category></item><item><title><![CDATA[数据结构：树和二叉树]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/138862422</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/138862422</guid><author>2301_80709869</author><pubDate>Mon, 20 May 2024 14:51:05 +0800</pubDate><description><![CDATA[树是一种的数据结构，它是由n（n>=0）个有限节点组成的一个具有层次关系的集合。]]></description><category></category></item><item><title><![CDATA[数据结构：队列]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/138584996</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/138584996</guid><author>2301_80709869</author><pubDate>Tue, 14 May 2024 15:41:37 +0800</pubDate><description><![CDATA[队列：只允许在一段进行插入数据操作，在另一端进行删除数据操作的特殊线性表。具有先进先出的特点。a.入队列：进行插入操作的一端称为队尾。b.出队列：进行删除操作的一端成为队头。队列可以由数组和链表的结构实现。，因为如果使用数组的结构，出队列，效率会比较低。]]></description><category></category></item><item><title><![CDATA[VS的调试技巧]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/138767404</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/138767404</guid><author>2301_80709869</author><pubDate>Tue, 14 May 2024 10:25:46 +0800</pubDate><description><![CDATA[调试：找问题的过程。首先承认出现了问题，可能是逐过程的调试，也可能是隔离和屏蔽代码的方式。找到问题的位置，然后确定产生的原因，再修复代码，重新测试。]]></description><category></category></item><item><title><![CDATA[栈：括号匹配问题]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/138564186</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/138564186</guid><author>2301_80709869</author><pubDate>Wed, 08 May 2024 11:08:37 +0800</pubDate><description><![CDATA[关于栈的一道题]]></description><category></category></item><item><title><![CDATA[数据结构：栈]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/138525181</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/138525181</guid><author>2301_80709869</author><pubDate>Tue, 07 May 2024 14:39:28 +0800</pubDate><description><![CDATA[栈 ：一种特殊的线性表，其只允许在固定的一端进行插入和删除元素操作。进行数据插入和删除操作的一端称为栈顶，另一端称为栈底。栈中的数据元素遵守后进先出LIFO （ Last In First Out ） 的原则。入栈：栈的插入操作叫做进栈 / 压栈 / 入栈， 入数据在栈顶。出栈：栈的删除操作叫做出栈。出数据也在栈顶。]]></description><category></category></item><item><title><![CDATA[C语言：求和Sn=a+aa+aaa+aaaa+aaaaa]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/138473726</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/138473726</guid><author>2301_80709869</author><pubDate>Sun, 05 May 2024 20:57:04 +0800</pubDate><description><![CDATA[【代码】C语言：求和Sn=a+aa+aaa+aaaa+aaaaa。]]></description><category></category></item><item><title><![CDATA[C语言：水仙花数]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/138471980</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/138471980</guid><author>2301_80709869</author><pubDate>Sun, 05 May 2024 19:47:59 +0800</pubDate><description><![CDATA[水仙花数”是指一个n位数，其，如:153＝1^3＋5^3＋3^3，则153是一个“水仙花数”。]]></description><category></category></item><item><title><![CDATA[C语言：打印菱形]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/138439785</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/138439785</guid><author>2301_80709869</author><pubDate>Sat, 04 May 2024 13:16:40 +0800</pubDate><description><![CDATA[：2*(line-1-i)-1的方式减少。空格：从上往下，一行减少一个。空格：从上往下，一行增加一个。上三角：先输出空格，后输出**：2*i+1的方式递增。下三角：先输出空格，后输出*]]></description><category></category></item><item><title><![CDATA[C语言：实现有序表的折半查找]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/138420029</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/138420029</guid><author>2301_80709869</author><pubDate>Fri, 03 May 2024 17:22:31 +0800</pubDate><description><![CDATA[【代码】C语言二分查找。]]></description><category></category></item><item><title><![CDATA[顺序表的经典算法（双指针）]]></title><link>https://blog.youkuaiyun.com/2301_80709869/article/details/138383185</link><guid>https://blog.youkuaiyun.com/2301_80709869/article/details/138383185</guid><author>2301_80709869</author><pubDate>Thu, 02 May 2024 20:11:40 +0800</pubDate><description><![CDATA[思路：从后往前比大小，谁大谁往后放。]]></description><category></category></item></channel></rss>