资源列表
Demo1
- 双向链表的应用 26个英文字母 任意输入一个整数，能够实现以下功能：例如输入3, 输出结果为：DEFGHJKLMNOPQRSTUVWXYZABC-Two-way chain table 26 English letters of the application of arbitrary input an integer, can achieve the following functions: 3 such as input, The output is: DEFGHJKLMNOPQRS
data-structure
- 一份数据结构课程的课件，内容详细，初学者可以看懂，希望大家多多留意-A data structure curriculum courseware, detailed and beginners can understand, I hope a lot of attention
Kuruskal_Minispining_tree
- 最小生成树Kruskal算法的实现，采用openGL显示界面，支持顶点数量设置，以及位置移动，边的权值可自行设置，界面右侧分两个版图，上方是原图，下方为算法运行过程图-Implement Kruskal minimum spanning tree algorithm, using openGL display interface, support for setting the number of vertices, and the location of the mobile, edge we
taskschedule
- 采用贪心算法中的拟阵思想来解决cpu进程调度问题，最小化惩罚-Use greedy algorithm to solve Matroid thought process cpu scheduling problem, minimize punishment
partition-package
- 采用贪心算法来解决部分背包问题，简化了动态规划思想，提高了算法效率-Use the greedy algorithm to solve some of the knapsack problem, simplify the dynamic programming, improving the efficiency of the algorithm
shuangxianglianbiao
- 该程序主要练习了数据结构中双向链表的一些基本操作，可以用来熟悉双向链表的操作-The program is mainly practiced in the data structure of some of the basic operation of two-way linked list, can be used to familiar with the operation of two-way linked list
jisuandiguicishu
- 该程序主要功能是计算程序中递归算法的次数，可以用来判断递归算法的效率-The main function of the program is to calculate the number of recursive algorithm, can be used to judge the efficiency of recursive algorithm
duiliedemo
- 该程序主要练习了数据结构中队列结构的一些基本操作，都是经过验证可以用的-The program is mainly practiced in the data structure of the structure of some of the basic operations of the structure, are verified to be used
danlianbiaojiegou
- 数据结构中对单链表的一些基本操作，如插入，删除，判断表空，求链表长度等等。-Data structure in a single list of some of the basic operations, such as insert, delete, determine the table space, and the length of the list, etc..
Min
- 构建一个容量为k的大根堆，依次读取int数据，若大根堆已满，则比较读取的元素是否小于堆顶最大元素，是则先将最大元素删除，再将新元素压入。若大根堆未满，则直接将读取的元素 压入大根堆。在将n个元素依次判断比较处理完之后，即得到n个数据中最小的k个数据。将其从堆顶依次弹出，即将最小的k个元素从大到小输出。-Building a capacity of large root heap k sequentially read int data elements if a large root hea
Train
- 利用栈的结构，进行列车的压入和弹出，过程中如果压入数量超过了栈的范围或弹出的数不是最顶端元素，则不可能实现。 构造stack类，建立queue数组存放开出列车序列。依次检验其中的元素能否实现。-The use of the stack structure, conduct trains push and pop, if the process is pressed into the stack quantity exceeds range or number is not the most
Interview
- Interview题目是对n个数据进行排序再输出。利用循环链表可以方便的进行m次后移，并且利于倒序输出。构建结构体struct in，结构体中有每个面试者的编号no，和指向下一个结构体的指针。-Interview data subject is a sort of n and then output. Use circular list can easily be moved after m times, and is conducive to reverse output. Construct