<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ditai7690的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ditai7690</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ditai7690]]></copyright><item><title><![CDATA[VIVO2019秋招笔试]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961098</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961098</guid><author>ditai7690</author><pubDate>Wed, 11 Sep 2019 17:29:00 +0800</pubDate><description><![CDATA[三道编程题
1、考察栈。
2、考察二维费用的背包问题。
3、一维消消乐，求分数的最优解（取决于消了先后顺序，如果消完一个，可以得到另一个新的，这样的优先消）。
总体不算太难！

转载于:https://www.cnblogs.com/maider/p/11507563.html...]]></description><category></category></item><item><title><![CDATA[排序2-3、基数排序]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961097</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961097</guid><author>ditai7690</author><pubDate>Mon, 19 Aug 2019 13:42:00 +0800</pubDate><description><![CDATA[桶排序：

基数排序：



转载于:https://www.cnblogs.com/maider/p/11376652.html]]></description><category></category></item><item><title><![CDATA[排序2-2、表排序]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961096</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961096</guid><author>ditai7690</author><pubDate>Mon, 19 Aug 2019 11:04:00 +0800</pubDate><description><![CDATA[不交换元素，交换指向元素的指针的顺序，是间接排序的方法

如果一定要排序，可以通过表排序之后，再对数据排序，这里包含了“环”的概念。



转载于:https://www.cnblogs.com/maider/p/11375918.html...]]></description><category></category></item><item><title><![CDATA[排序2-1、快速排序]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961094</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961094</guid><author>ditai7690</author><pubDate>Mon, 19 Aug 2019 10:31:00 +0800</pubDate><description><![CDATA[子集划分：
https://www.icourse163.org/learn/ZJU-93001?tid=1206471203#/learn/content?type=detail&amp;id=1211167115&amp;cid=1213729377





#include &lt;iostream&gt;
using namespace std;
...]]></description><category></category></item><item><title><![CDATA[树2-2、平衡二叉树]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961095</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961095</guid><author>ditai7690</author><pubDate>Fri, 16 Aug 2019 16:40:00 +0800</pubDate><description><![CDATA[一、平衡二叉树的定义




平衡二叉树的调整
https://www.icourse163.org/learn/ZJU-93001?tid=1206471203#/learn/content?type=detail&amp;id=1211167090&amp;cid=1213729228
四种模式：
1、插入Nov后会导致以Mar为根结点的树不平衡，我们说Nov在Ma...]]></description><category></category></item><item><title><![CDATA[树2-1、二叉搜索树]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961093</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961093</guid><author>ditai7690</author><pubDate>Fri, 16 Aug 2019 16:14:00 +0800</pubDate><description><![CDATA[一、二叉搜索树的定义

二、二叉搜索树的查找操作




三、二叉搜索树的插入操作

四、二叉搜索树的删除操作





转载于:https://www.cnblogs.com/maider/p/11364623.html...]]></description><category></category></item><item><title><![CDATA[机器人离线仿真系统展示]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961092</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961092</guid><author>ditai7690</author><pubDate>Fri, 16 Aug 2019 15:04:00 +0800</pubDate><description><![CDATA[功能介绍：
一、计算机辅助设计功能（CAD）
　　1、可在工作站中建立常见的几何模型；
　　2、可以导入外部常见格式的物理模型（如IGES，STEP，STL等）；
　　3、在工作站内对模型进行一系列操作（如切割，合并，求两物体的相交线等）。
二、离线轨迹规划功能：
　　1、根据导入的模型，选择一定的方式，在复杂曲面生成一系列含有模型表面信息的点云；
　　2、将点云有序整理成...]]></description><category></category></item><item><title><![CDATA[树1-4、树的同构]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961091</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961091</guid><author>ditai7690</author><pubDate>Fri, 16 Aug 2019 11:00:00 +0800</pubDate><description><![CDATA[转载于:https://www.cnblogs.com/maider/p/11362586.html]]></description><category></category></item><item><title><![CDATA[树1-3、二叉树的遍历]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961090</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961090</guid><author>ditai7690</author><pubDate>Fri, 16 Aug 2019 10:55:00 +0800</pubDate><description><![CDATA[一、先序遍历、中序遍历、后序遍历



用堆栈实现非递归中序遍历：


二、层序遍历



转载于:https://www.cnblogs.com/maider/p/11362547.html]]></description><category></category></item><item><title><![CDATA[树1-2、二叉树及存储结构]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961088</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961088</guid><author>ditai7690</author><pubDate>Fri, 16 Aug 2019 10:14:00 +0800</pubDate><description><![CDATA[二叉树的定义：


二叉树的重要性质：


二叉树的存储结构：用数组存储完全二叉树


二叉树的存储结构：用链表存储


转载于:https://www.cnblogs.com/maider/p/11362237.html...]]></description><category></category></item><item><title><![CDATA[树1-1、树与树的表示]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961089</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961089</guid><author>ditai7690</author><pubDate>Fri, 16 Aug 2019 09:02:00 +0800</pubDate><description><![CDATA[旋转得到二叉树！


转载于:https://www.cnblogs.com/maider/p/11361766.html]]></description><category></category></item><item><title><![CDATA[图3-2、拓扑排序]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961086</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961086</guid><author>ditai7690</author><pubDate>Thu, 15 Aug 2019 18:42:00 +0800</pubDate><description><![CDATA[解决排课问题：


每一次先选择入度为0的结点。


AOE问题：



转载于:https://www.cnblogs.com/maider/p/11359795.html]]></description><category></category></item><item><title><![CDATA[图3-1、最小生成树]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961087</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961087</guid><author>ditai7690</author><pubDate>Thu, 15 Aug 2019 16:42:00 +0800</pubDate><description><![CDATA[贪心算法之Prim算法：


贪心算法之Kruskal算法：https://www.icourse163.org/learn/ZJU-93001?tid=1206471203#/learn/content?type=detail&amp;id=1211167108&amp;cid=1213729334&amp;replay=true



转载于:https://w...]]></description><category></category></item><item><title><![CDATA[图2-1、最短路径问题]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961085</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961085</guid><author>ditai7690</author><pubDate>Thu, 15 Aug 2019 16:22:00 +0800</pubDate><description><![CDATA[一、无权图的单源最短路径算法

广度优先搜索的思想，所有的结点有一个编号，数组dist的下标编号表示结点，dist的内容表示最短距离
数组path的下标编号表示结点，path的内容表示在最短距离中，它的上一个结点的编号
假设无权图由链表的方式表达，时间复杂度为O（|V|+|E|）
例子：
 ——&gt;

二、有权图的单源最短路算法

不考虑有负值圈的情况。
...]]></description><category></category></item><item><title><![CDATA[图1-3、图的建立]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961084</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961084</guid><author>ditai7690</author><pubDate>Thu, 15 Aug 2019 15:30:00 +0800</pubDate><description><![CDATA[建立邻接矩阵：


简单点，可以这样：

邻接表：




转载于:https://www.cnblogs.com/maider/p/11358249.html]]></description><category></category></item><item><title><![CDATA[图1-2、图的遍历]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961083</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961083</guid><author>ditai7690</author><pubDate>Thu, 15 Aug 2019 14:52:00 +0800</pubDate><description><![CDATA[1、深度优先搜索


/* 邻接表存储的图 - DFS */
 
void Visit( Vertex V )
{
    printf("正在访问顶点%d\n", V);
}
 
/* Visited[]为全局变量，已经初始化为false */
void DFS( LGraph Graph, Vertex V, void (*Visit)(Vertex) )
{...]]></description><category></category></item><item><title><![CDATA[图1-1、基本概念]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961082</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961082</guid><author>ditai7690</author><pubDate>Thu, 15 Aug 2019 14:23:00 +0800</pubDate><description><![CDATA[用邻接矩阵表示图：

用邻接表表示图：



转载于:https://www.cnblogs.com/maider/p/11357686.html]]></description><category></category></item><item><title><![CDATA[排序1-4、归并排序]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961081</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961081</guid><author>ditai7690</author><pubDate>Thu, 15 Aug 2019 10:41:00 +0800</pubDate><description><![CDATA[归并排序的递归算法：






转载于:https://www.cnblogs.com/maider/p/11356521.html]]></description><category></category></item><item><title><![CDATA[排序1-3、堆排序]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961078</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961078</guid><author>ditai7690</author><pubDate>Thu, 15 Aug 2019 10:24:00 +0800</pubDate><description><![CDATA[先说说选择排序：

堆排序是对选择排序的改进

算法1，是生成一个传统的最小堆，逐步取树根元素，存入数组

真正的堆排序算法，思想是把A调成一个最大堆，把最大元素跟末尾元素交换，最大堆大小减1，然后调整，知道最大堆只有1个元素。
这里的最大堆跟传统的最大堆区别在于，它的下标是从0开始的，写代码的时候要注意一下。


转载于:https://www.cnblogs.com...]]></description><category></category></item><item><title><![CDATA[排序1-2、希尔排序]]></title><link>https://blog.youkuaiyun.com/ditai7690/article/details/101961080</link><guid>https://blog.youkuaiyun.com/ditai7690/article/details/101961080</guid><author>ditai7690</author><pubDate>Thu, 15 Aug 2019 10:13:00 +0800</pubDate><description><![CDATA[基于插入排序





转载于:https://www.cnblogs.com/maider/p/11356284.html]]></description><category></category></item></channel></rss>