数据结构
sxh759151483
这个作者很懒,什么都没留下…
展开
-
优先队列(详解)
优先队列:顾名思义,首先它是一个队列,但是它强调了“优先”二字,所以,已经不能算是一般意义上的队列了,它的“优先”意指取队首元素时,有一定的选择性,即根据元素的属性选择某一项值最优的出队~百度百科上这样描述的: 优先级队列 是不同于先进先出队列的另一种队列。每次从队列中取出的是具有最高优先权的元素 优先队列的类定义 优先队列是0个或多个元素的集合,每个元素都有一个优先权或值,对优转载 2017-09-16 20:49:18 · 1904 阅读 · 0 评论 -
优先队列
#include #include #include #include using namespace std; //定义结构,使用运算符重载,自定义优先级1 struct cmp1{ bool operator ()(int &a,int &b){ return a>b;//最小值优先 } }; struct cmp2{转载 2017-09-19 15:48:19 · 265 阅读 · 0 评论 -
hdu1053Entropy(哈弗曼编码)
EntropyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6746 Accepted Submission(s): 2871Problem DescriptionAn entropy encoder is原创 2017-11-27 17:36:01 · 248 阅读 · 0 评论 -
Tree Construction (set模拟二叉排序树)
Tree Construction During the programming classes Vasya was assigned a difficult problem. However, he doesn't know how to code and was unable to find the solution in the Internet, so he asks原创 2018-01-31 09:02:12 · 322 阅读 · 0 评论 -
二叉树已知 先序 中序 求后序遍历序列
Tree描述Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes. This is an example of one of her c...原创 2018-06-09 13:44:49 · 937 阅读 · 0 评论