资源列表
pragma-warning
- 从输入的英文句子中找出单词个数，并找出最长的单词和最短的单词。-English sentences from the input to find the number of words, and find the longest words and the shortest words.
zjhwt
- 算法设计与分析，子集问和题，用文档输入输出结果-Algorithm design and analysis, a subset of questions asked and with the results of input and output documents
fraction
- 分数类的构造，析构，及实现加减乘除运算函数文件-Score class constructor, destructor, and implementation of addition and subtraction multiplication and division function file
array-queue
- Array Queue code in C and C++ language
huibian2
- 将一个包含有20个有符号数据的数组M分成两个数组：正数数组和负数数组N，并分别把这两个数组中的数据个数显示出来。-One containing 20 M signed an array of data into two arrays: an array of positive and negative array N, and these two were the number of data in the array is displayed.
ACM_kuohaoshendu
- 括号深度题解的源代码，是一种改进的算法，-kuohao depth
Stack-processing-data
- 编写三个函数；主函数、进栈函数、出栈函数。 主函数定义并初始化堆栈，用一个循环，由用户输入对堆栈的操作要求，进栈、出栈或结束操作。 进栈函数在数据进栈前要测试堆栈是否已满，如果已满，则输出提示，告知堆栈已满并取消本次进栈操作；如果未满，将数据进栈并修改栈顶指示器。 出栈函数在数据前要测试堆栈是否已空，如果已空，则输出提示，告知堆栈已空并取消本次出栈操作；如果为空，将栈顶出栈并修改栈顶指示器。数据出栈应将其输出到屏幕。 . -Stack processing data
shortest-path
- 最短路径算法，基于图论的网络图理论，代码简单，可以自行修改矩阵-Shortest path algorithm, network diagrams based on graph theory, a simple code, you can modify the matrix
Bloomfilter
- 一个基于APHash方法设计的Bloomfilter 构造需要提供参数：size（字符串总数）-The design based on APHash method Bloomfilter. Construct parameter: size (total number of strings)
12
- c编写的链表连接函数，上课时学的，上传试试 -c write the list to connect function, class, learn, try uploading
fibonacci
- 优化的fibonacci数列计算程序，可以较短时间计算出较大的数字-Fibonacci series, optimization program that can calculate the short time a large number of
sequence-node
- 数据结构习题代码：假设以带头结点的循环链表表示队列，并且只设一个指针指向队尾元素结点而不设头指针，试编写相应的队列初始化、入队列、出队列和判断队列状态的算法。-Assuming lead to circular list node represents a queue, and only set up a pointer to the tail element nodes instead of being the head pointer, try to prepare the correspo