资源列表
sort_leap
- 堆排序是一种比较优化的排序方法，特备是在只是找一串数字中前几个最大最小值时更显示它的优势。这个程序的堆排序包括每一轮的堆排序的调整以及最终的排序结果的显示。-leap sorted method is a excellent way to handle the sequence , exspecially when you want to find the proitory max or min number .the program concludes the method of the ad
bracket_matching
- 括号匹配是栈的一种经典应用。本功能主要是实现输入一串字符（里面包括左括号右括号等），判断你的括号是否有相应的匹配值。如果没有则返回错误并退出程序。-bracket matching program is the typical application of stack. the program of it is to check whether the sequence have been right in the aspect of bracket.
ReverseLinkedListEveryKNodes
- 链表中每K个节点 逆置。..导入eclipse时要改包名package classOne -Reverse LinkedList Every K Nodes change package name,
BSTToDoubleLinkedList
- 二叉搜索树 转为 双向链表， 导入eclipse时要改包名package classOne -BST To Double LinkedList change package name,
BuildQueueByTwoStacks
- 通过2个队列来模拟栈， 运行导入eclipse时要改包名package classOne -Build Queue By Two Stacks， change package name,
CopyContainsRandomPartList
- 复制具有随机域节点的链表， 导入eclipse时要改包名package classOne -Copy Contains Random Part List
java
- JAVA经典教程，初学者的福利，赶快下载吧！-JAVA classic tutorial, beginners welfare, to download it!
Apostolico-Crochemore
- Java Dizgi Eş leme Algoritmaları Apostolico-Crochemore algoritması
Huffman
- 利用最小堆实现霍夫曼编码，建立霍夫曼树，并且实现插入，删除，输出等功能-Use minheap to bulid the huffman tree
AVL
- 可以根据自己输入来建立平衡二叉树，并且根据左旋，右旋等方式实现插入删除功能-Build the Avl tree,and you can insert or delete the number
bianli_feidigui
- 建立二叉树，并且按照非递归的方法实现前序遍历，后序遍历和中序遍历-Establishment of binary tree, and to achieve a preorder traversal non-recursive method in accordance with, subsequent traversal and preorder
Polynomial
- 通过链表的方式，实现了两种不同方式下的多项式相加-Through the list of ways to achieve a polynomial in two different ways under the sum