<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[芊樱烛渊的博客]]></title><description><![CDATA[凑个整，就1024吧]]></description><link>https://blog.youkuaiyun.com/weixin_62684026</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; weixin_62684026]]></copyright><item><title><![CDATA[【王道数据结构】【强化练习】【图的应用】【4.2.1-4.2.2】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/140611451</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/140611451</guid><author>weixin_62684026</author><pubDate>Mon, 22 Jul 2024 16:39:48 +0800</pubDate><description><![CDATA[定义一个顺序存储的图（邻接矩阵实现）定义一个链式存储的图（邻接表实现）]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【强化练习】【树的应用】【3.1.2-3.5.5】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/140571761</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/140571761</guid><author>weixin_62684026</author><pubDate>Mon, 22 Jul 2024 15:16:47 +0800</pubDate><description><![CDATA[定义顺序存储的二叉树（数组实现，树的节点下标从1开始存储）定义函数rightchild，用于返回结点i的右孩子的编号。定义顺序存储的二叉树（数组实现，树的节点下标从0开始存储）定义函数rightchild，用于返回结点i的右孩子的编号。定义函数leftchild，用于返回结点i的左孩子编号。定义函数leftchild，用于返回结点i的左孩子编号。基于上述定义，实现并查集的基本操作union。基于上述定义，实现并查集的基本操作find。使用孩子兄弟表示法定义链式存储的树。使用孩子表示法，定义链式存储的树。]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【强化练习】【“栈、队列”的应用】【2.1.1-2.2.4】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/140524088</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/140524088</guid><author>weixin_62684026</author><pubDate>Thu, 18 Jul 2024 16:57:36 +0800</pubDate><description><![CDATA[基于上述定义，栈顶在链尾，实现“出栈、入栈、判空、判满”四个基本操作。定义顺序存储的队列（数组实现），要求数组空间可以循环使用。基于上述定义，实现出队、入队、判空、判满四个基本操作。基于上述定义实现“出队、入队、判空、判满四个操作。栈顶在链头，实现出栈、入栈、判空、判满四个操作。基于上述定义，实现出栈、入栈、判空、判满。基于链式存储的队列（单链表实现）定义链式存储的栈（单链表表示）定义链式存储的栈（双向链表实现。定义顺序存储的栈（数组实现）]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter8排序】【P391t3】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136421624</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136421624</guid><author>weixin_62684026</author><pubDate>Sat, 02 Mar 2024 20:18:29 +0800</pubDate><description><![CDATA[设一个数组中存放了一个无序的关键序列K1,K2,……Kn，现要求将Kn放在将元素排序后的正确位置上，试编写实现该功能的算法，要求比较关键字的次数不超过n。]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter8排序】【P391t2】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136413101</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136413101</guid><author>weixin_62684026</author><pubDate>Sat, 02 Mar 2024 12:06:58 +0800</pubDate><description><![CDATA[设顺序表用数组A[]表示，表中元素存储在数组下标1~m+n的范围内，前m个元素递增有序，后n个元素递增有序，设计一个算法，使得整个顺序表有序。]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter8排序】【P371t6】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136407496</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136407496</guid><author>weixin_62684026</author><pubDate>Fri, 01 Mar 2024 22:43:54 +0800</pubDate><description><![CDATA[试设计一个算法，判断一个数据序列是否构成一个小根堆（下面代码中的堆排序的部分仅仅是为了方便设计测试用例）]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter8排序】【P371t5】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136406799</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136406799</guid><author>weixin_62684026</author><pubDate>Fri, 01 Mar 2024 21:55:53 +0800</pubDate><description><![CDATA[编写一个算法，在基于单链表表示的待排序关键字序列上进行简单选择排序。]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter8排序】【P361t4】【统考真题】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136392448</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136392448</guid><author>weixin_62684026</author><pubDate>Fri, 01 Mar 2024 12:29:10 +0800</pubDate><description><![CDATA[下面代码中的快排部分仅仅是为了方便查看输出结果是不是正确用的，并不是解答的一部分。]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter8排序】【P360t3】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136391629</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136391629</guid><author>weixin_62684026</author><pubDate>Fri, 01 Mar 2024 11:43:16 +0800</pubDate><description><![CDATA[荷兰国旗问题：设有一个仅由红、白、蓝三种颜色的条块组成的条状序列，存储在一个顺序表中，请编写一个时间复杂度为O(N)的算法，是这些条块按照红、白、蓝的顺序排好，即排成荷兰国旗图案。]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter8排序】【P360t2】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136391143</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136391143</guid><author>weixin_62684026</author><pubDate>Fri, 01 Mar 2024 11:28:24 +0800</pubDate><description><![CDATA[试编写一个算法，使之能够在数组L[1……n]中找出第k小的元素（即从小到大排序后处于第k个位置的元素）（可以直接采用排序，但下面的排序的代码只是为了方便核对是不是第k小的元素，k从0开始计算）]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter8排序】【P360t1】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136390043</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136390043</guid><author>weixin_62684026</author><pubDate>Fri, 01 Mar 2024 10:58:06 +0800</pubDate><description><![CDATA[已知线性表按顺序存储，且每个元素都是不相同的整数型元素，设计把所有奇数移动到所有偶数前边的算法（要求时间最短，辅助空间最小）]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter7查找】【P309t10】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136358225</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136358225</guid><author>weixin_62684026</author><pubDate>Wed, 28 Feb 2024 22:46:12 +0800</pubDate><description><![CDATA[边那些一个递归算法，在一棵有n个几点的、随机建立起来的二叉排序树上查找第k(1]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter7查找】【P309t9】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136357616</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136357616</guid><author>weixin_62684026</author><pubDate>Wed, 28 Feb 2024 22:10:11 +0800</pubDate><description><![CDATA[设计一个算法，从大到小输出二叉排序树中所有值不小于k的关键字。]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter7查找】【P309t8】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136357456</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136357456</guid><author>weixin_62684026</author><pubDate>Wed, 28 Feb 2024 22:02:10 +0800</pubDate><description><![CDATA[设计一个算法，求出给定二叉排序树中最小和最大的关键字。]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter7查找】【P308t7】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136357293</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136357293</guid><author>weixin_62684026</author><pubDate>Wed, 28 Feb 2024 21:54:00 +0800</pubDate><description><![CDATA[利用二叉树遍历的思想编写一个判断二叉树是否是平衡二叉树的算法。]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter7查找】【P308t6】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136356927</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136356927</guid><author>weixin_62684026</author><pubDate>Wed, 28 Feb 2024 21:36:54 +0800</pubDate><description><![CDATA[设计一个算法，求出指定结点在给定二叉排序树中的层次。]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter7查找】【P308t5】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136356495</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136356495</guid><author>weixin_62684026</author><pubDate>Wed, 28 Feb 2024 21:16:51 +0800</pubDate><description><![CDATA[试编写一个算法，判断给定的二叉树是否是二叉排序树。]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter7查找】【P285t6】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136333826</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136333826</guid><author>weixin_62684026</author><pubDate>Tue, 27 Feb 2024 22:54:18 +0800</pubDate><description><![CDATA[这题只能从左下角或者右上角的顶点开始查找，如果是左上角，它的右边和下面的点的值都比它大，我们并不知道往哪边走，右下角的点也一样。]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter7查找】【P285t5】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136333441</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136333441</guid><author>weixin_62684026</author><pubDate>Tue, 27 Feb 2024 22:27:05 +0800</pubDate><description><![CDATA[线性表中各节点的检索概率不等时，可用如下策略提高顺序检索的效率；若找到指定的结点，则将该结点和其前驱结点（若存在）交换，使得经常被访问的结点尽量位于表的前端。试设计在顺序结构和链式结构的线性表盘上实现上述策略的顺序检索算法。对于顺序结构上的测试结果。在链式结构上的搜索结构。]]></description><category></category></item><item><title><![CDATA[【王道数据结构】【chapter7查找】【P285t4】]]></title><link>https://blog.youkuaiyun.com/weixin_62684026/article/details/136332479</link><guid>https://blog.youkuaiyun.com/weixin_62684026/article/details/136332479</guid><author>weixin_62684026</author><pubDate>Tue, 27 Feb 2024 21:35:55 +0800</pubDate><description><![CDATA[写出折半查找的递归算法。初始调用时，low为1，high为ST.length（下面的实现大体是相同的，就是没有进行封装）第一个测试用例是一定可以查找到的，第二个不一定查找得到。]]></description><category></category></item></channel></rss>