资源列表
YangHui
- 使用队列的数据结构，实现杨辉三角的输出，输入N行，得到N行输出-Use the queue data structure, to achieve output Pascal' s triangle, enter N lines, give N line output
HString
- 通过堆串的存储方式，实现串的初始化，赋值和拷贝操作-String stored by the stack to achieve the initialization string, assignments, and the copy operation
Joseph-Circle
- 使用链表实现约瑟夫环，总人数为N，报数M的人出列，得出依次出列的人的序号和最终留下来的人-Use the list to achieve Josephus, the total number of N, reported that the number of people out of the line M, derived in turn out of the line and the final number of persons who stay
KMP
- 使用KMP算法进行模式匹配，算出模式串中next[j]的下标-KMP algorithm using pattern matching, calculated pattern string next [j] subscr ipt
BM
- 使用BM算法对字符串进行模式匹配，得出主串和模式串的匹配下标-BM algorithm using a pattern matching string, draw strings and the main index matching string pattern
parenthesis-matching
- 链栈的方式实现括号匹配的判断，匹配返回成功的提示，不匹配则提示哪个括号不匹配-Judgment chain stack way to achieve parenthesis matching, matching returns success tips, which does not match the prompt does not match brackets
pingguojiufeng
- 数学上有一种分苹果问题，此程序是对它的合理编程- there is a problem of apple problem, this program is for its reasonable programming
qiujinzhi
- 此程序可以很方便的实现各个进制数之间的灵活转换-This procedure can easily realize the flexible conversion between hexadecimal number
zhuanhuan
- 此程序可以很灵活的实现大小写字母之间的灵活转换-This program can be very flexible flexible conversion between the lowercase letters
duoxiangshi
- 自己编写的用链表实现的多项式，包括多项式的加法和乘法运算-I have written a polynomial with a linked list implementation, including the addition and multiplication of polynomials
Stack
- 用C++写的栈的实现算法，比较好用。其中的栈用两种方法实现，一个是顺序栈，用动态数组实现的；另一个是链式栈，用链表实现的。-Written by C++ stack algorithm, relatively easy to use. Stack them in two ways, one is the order of the stack, with a dynamic array implementations Another is a chain stack, using a linke
buildTree
- 二叉树是采用递归定义的，实现起来代码简洁并且它在具体的计算机科学中有很重要的运用，是一种很重要的数据结构，二叉树有三种遍历和建立的方式。-Binary Tree is a recursive definition, the code is simple to implement and it has very important applications in computer science in particular, is a very important data structure,