<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[m0_72000264的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_72000264</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_72000264]]></copyright><item><title><![CDATA[HashMap和HashSet]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/130683058</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/130683058</guid><author>m0_72000264</author><pubDate>Mon, 15 May 2023 16:25:55 +0800</pubDate><description><![CDATA[哈希表]]></description><category></category></item><item><title><![CDATA[各类排序的性能及实现]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/130621303</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/130621303</guid><author>m0_72000264</author><pubDate>Thu, 11 May 2023 18:00:48 +0800</pubDate><description><![CDATA[Java排序方法中，分为基于比较的排序方法和非基于比较的排序方法。基于比较的排序方法适用于各类规模的数据，适用范围比较广。非基于比较的排序方法需要占用空间来确定其唯一位置，所以适用范围有限。不要求稳定，数据规模小，且数据无序的情况下，选择快速排序；要求稳定且数据规模小，数据有序的情况下，选择插入排序，数据无序的情况下，选择归并排序；若数据规模较大，选择快速排序，归并排序，或堆排序。]]></description><category></category></item><item><title><![CDATA[数组中最小的k个数&第k大的数字]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/130409241</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/130409241</guid><author>m0_72000264</author><pubDate>Thu, 27 Apr 2023 17:00:41 +0800</pubDate><description><![CDATA[思路：找到k个最大的数字，其中最小的数字即为数组中第k大的数字。采用小根堆存储k个最大的数字，每次从数组中，然后判断数组中其他数字是否小于堆顶的最小值，如果新读入的数字比堆顶数字的值要大，那么就弹出堆顶数字，将新的数字入堆。思路：采用大根堆维护数组中的前k个最小的值。首先将k个数插入大根堆，然后从k+1个数开始遍历数组，遍历到比大根堆中堆顶的数要小的数值，就弹出堆顶的数，并插入当前遍历到的数。最后，将k个最小值存储到数组中返回即可。例题2：数组中第k大的数字。例题1：数组中最小的k个数。]]></description><category></category></item><item><title><![CDATA[构造二叉树]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/130289906</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/130289906</guid><author>m0_72000264</author><pubDate>Fri, 21 Apr 2023 16:00:42 +0800</pubDate><description><![CDATA[思路：线序遍历的第一个元素就是根节点，通过中序遍历可以得到左子树和右子树，再将左右子树分别看成一颗独立的数，继续使用先序遍历判断根节点，再通过中序遍历得到子树。思路：后续遍历的最后一个元素为根节点，结合根节点在中序的位置，得到左子树和右子树，针对每个部分可以用同样的方法继续递归下去构造。例题1. 从前序与中序遍历序列构造二叉树。例题2. 从中序与后续遍历序列构造二叉树。前序遍历顺序：根->左->右。中序遍历顺序：左->根->右。中序遍历顺序：左->根->右。后序遍历顺序：左->右->根。]]></description><category></category></item><item><title><![CDATA[实现队列和栈的转换]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/130154896</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/130154896</guid><author>m0_72000264</author><pubDate>Fri, 14 Apr 2023 16:24:59 +0800</pubDate><description><![CDATA[两个队列，queue1用于存储栈内的元素，queue2作为入栈操作的辅助队列。入栈时，首先将元素入栈到queue2，然后将queue1的全部元素依次出队，并入队道queue2，此时queue2的前端元素即为新入栈的元素。然后，将queue1和queue2互换，这样，queue1的元素就为栈内的元素，queue1的前端和后端分别对应栈顶和栈底。每次出栈或查看栈顶元素时，若输出栈为空，就将输入栈的全部元素弹出，并入栈到输出栈。如图，栈顶的元素先出栈，最后出栈的元素是最先进入栈的元素。]]></description><category></category></item><item><title><![CDATA[Java中处理异常的方法介绍]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/129851406</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/129851406</guid><author>m0_72000264</author><pubDate>Thu, 30 Mar 2023 14:27:55 +0800</pubDate><description><![CDATA[Java中处理异常的方法介绍]]></description><category></category></item><item><title><![CDATA[Java语法学习摘要]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/129852540</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/129852540</guid><author>m0_72000264</author><pubDate>Thu, 30 Mar 2023 11:18:06 +0800</pubDate><description><![CDATA[Java语法学习摘要]]></description><category></category></item><item><title><![CDATA[继承，组合，和多态的介绍]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/129671571</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/129671571</guid><author>m0_72000264</author><pubDate>Mon, 20 Mar 2023 19:02:37 +0800</pubDate><description><![CDATA[Java中的继承，组合，和多态的介绍]]></description><category></category></item><item><title><![CDATA[预定义宏&与函数对比]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/128960623</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/128960623</guid><author>m0_72000264</author><pubDate>Thu, 09 Feb 2023 21:39:42 +0800</pubDate><description><![CDATA[对于宏定义，我们使用#define 预定义指令]]></description><category></category></item><item><title><![CDATA[通讯录的加载和保存]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/128697408</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/128697408</guid><author>m0_72000264</author><pubDate>Sun, 15 Jan 2023 21:00:12 +0800</pubDate><description><![CDATA[通讯录的加载和保存]]></description><category></category></item><item><title><![CDATA[动态通讯录]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/128687126</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/128687126</guid><author>m0_72000264</author><pubDate>Sat, 14 Jan 2023 18:11:28 +0800</pubDate><description><![CDATA[改造动态通讯录]]></description><category></category></item><item><title><![CDATA[实现一个通讯录（添加/删除/查找/修改/按姓名排序）]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/128664759</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/128664759</guid><author>m0_72000264</author><pubDate>Thu, 12 Jan 2023 19:00:21 +0800</pubDate><description><![CDATA[实现一个通讯录（添加/删除/查找/修改/按姓名排序）]]></description><category></category></item><item><title><![CDATA[用C语言模拟实现memcpy函数，memmove函数]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/128642779</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/128642779</guid><author>m0_72000264</author><pubDate>Wed, 11 Jan 2023 12:40:01 +0800</pubDate><description><![CDATA[用C语言模拟实现memcpy函数，memmove函数]]></description><category></category></item><item><title><![CDATA[用For循环语句判断真假]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/128592026</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/128592026</guid><author>m0_72000264</author><pubDate>Sat, 07 Jan 2023 16:41:28 +0800</pubDate><description><![CDATA[用For循环语句判断真假]]></description><category></category></item><item><title><![CDATA[扫雷游戏的实现步骤和代码]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/127791153</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/127791153</guid><author>m0_72000264</author><pubDate>Thu, 10 Nov 2022 16:28:33 +0800</pubDate><description><![CDATA[扫雷游戏的步骤和代码]]></description><category></category></item><item><title><![CDATA[三子棋游戏的步骤和代码]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/127753285</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/127753285</guid><author>m0_72000264</author><pubDate>Tue, 08 Nov 2022 17:18:42 +0800</pubDate><description><![CDATA[用C语言实现三子棋]]></description><category></category></item><item><title><![CDATA[用C 语言实现斐波那契数列]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/127669666</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/127669666</guid><author>m0_72000264</author><pubDate>Thu, 03 Nov 2022 16:02:31 +0800</pubDate><description><![CDATA[用递归，非递归，和数组，实现斐波那契数列。]]></description><category></category></item><item><title><![CDATA[数据类型和运算]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/127473587</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/127473587</guid><author>m0_72000264</author><pubDate>Sun, 23 Oct 2022 14:12:56 +0800</pubDate><description><![CDATA[初识C语言：数据类型和分支结构]]></description><category></category></item><item><title><![CDATA[学习编程的计划和路线]]></title><link>https://blog.youkuaiyun.com/m0_72000264/article/details/127332558</link><guid>https://blog.youkuaiyun.com/m0_72000264/article/details/127332558</guid><author>m0_72000264</author><pubDate>Sat, 15 Oct 2022 12:06:43 +0800</pubDate><description><![CDATA[编程新手浅谈学习计划]]></description><category></category></item></channel></rss>