资源列表
Huffman-encoding
- 哈弗曼编码，解码，仿真通信系统，c语言，二叉树-The Huffman encoding, decoding, simulation of communication systems, c language, binary tree
bracket
- 括号字符串 一个合法的括号字符串，需满足下列情况之一 该字符串为”()” 该字符串可视作两个合法括号字符串顺序拼接，如”(())()” 该字符串形如”(+任意合法字符串+)”，如”(()())” 现在给定一个括号字符串，有一些位子的字符被’?’代替，这些问号可以任意填写为一个’(‘或者’)’，求把这个字符串填写为合法括号字符串的方法数。 【输入】 输入仅包含一个字符串，由括号与问号组成。 【输出】 输出合法字符串个数模上1000000007。 【输入样
MergeSort
- 利用非递归的方式实现归并排序。可理解为递归方法的逆过程。-The use of non-recursive merge sort. You can understand it as the inverse process of the recursive method.
BT
- code for binary tree A binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents.
ToH
- The Tower of Hanoi (also called the Tower of Brahma or Lucas Tower,[1] and sometimes pluralised) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts wit
stack1
- a stack is a particular kind of abstract data type or collection in which the principal (or only) operations on the collection are the addition of an entity to the collection, known as push and removal of an entity, known as pop.[1] The relation betw
DoubleLinkedList
- java描述的双链表，可以向前向后遍历，-java described doubly linked list, forward and backward traversal
sp
- 狄克斯特拉算法：求一点到其余点的最短路径-the Dijkstra for short path
SquStack_Expression
- 学习数据结构基础知识。用栈实现计算表达式值 //单文件格式-Learn basic knowledge of data structures. Calculation of the value of the expression stack// single-file format
complex
- 数据结构入门学习。负数实部虚部的存储及数学运算。-Data structure learning portal. Negative real part of the imaginary part of the store and math.
SquStack_Math
- 数据结构基础知识，用栈操作实现对括号进行匹配。-Basic knowledge of data structures, stack operation to match the brackets.
Queue_Plalindrome
- 数据结构基础知识学习，判断字符串是否回文。用栈操作实现。-To learn basic knowledge of data structures, to determine whether a string palindrome. Stack operations.