资源列表
huffmancode
- 哈夫曼编码是一种常用的数据压缩技术，对数据文件进行哈夫曼编码可大大缩短文件的传输长度，提高信道利用率及传输效率。要求采用哈夫曼编码原理，统计文本文件中字符出现的词频，以词频作为权值，对文件进行哈夫曼编码以达到压缩文件的目的，再用哈夫曼编码进行译码解压缩。 统计待压缩的文本文件中各字符的词频，以词频为权值建立哈夫曼树，并将该哈夫曼树保存到文件中。 -Huffman coding is a commonly used data compression technology, Huffman
Qsort1
- Qsort 大家熟知的算法，仔细整理出的模版，直接可用-Qsort well-known algorithm, carefully sorted out the template, can be used directly
ListNode
- 利用链表实现学生成绩信息管理，包括增加、删除、查找等操作。-The use of information management to achieve student performance list, including add, delete, search and other operations.
time_apart
- 分时系统模拟，C++代码，数据结构算法。自定义用户数量，cpu工作时间，等待时间-Time-sharing system simulation, C++ code, data structures, algorithms. Customize the number of users, cpu working hours, waiting time
Allocate
- Memory allocation If you want to allocate memory to vectors and matrices in C++ it will be very simple with this code. You just need to pass the adress of the pointer. Example: int **p MatrixAllocate(&p, 20, 100)
xianxingbiao
- 线性表的新建 查找 插入 合并及退出
5.6.1
- 1、二叉树的创建和遍历演示 1）从键盘输入二叉树的各结点值，按先序递归方式创建二叉树 2）分别实现先序、中序、后序递归遍历二叉树 3）输出二叉树的按层次遍历序列 4）输出二叉树的中序非递归遍历下的结点访问次序-1, binary tree traversal of the creation and demonstration of 1) from the keyboard input of the binary tree node value, according to firs
Climbingtrees
- ven a sequence of child-parent pairs, where a pair consists of the child s name followed by the (single) parent s name, and a list of query pairs also expressed as two names, you are to write a program to determine whether the query pairs are related
maze
- 迷宫问题 用c实现 Maze Maze源码-Maze Problems
the-roots-of-quadratic-equations
- search for the roots of quadratic equations
suffarray_c
- 后缀数组求最长公共子串 这里的最长公共子串是指的连续的子串，并非经典dp的那种。 aabbc abc 这两个字符串的最长公共子串为ab 算法复杂度是o(n)的（n为两个字符串长度的和）-suffix array for the longest string of public-public here - the longest string of consecutive refers to the substring. dp is not the
tongji
- 一个数据结构的课程设计，分数统计系统，为大家提供个参考吧。-A data structure of the curriculum design, fractional statistics system, provide a reference to it.