资源列表
The-NO.k-number
- 用堆排序求第k大的数，时间复杂度课达到O（nlog(2)k）-The k-heap sort and time complexity class of O (nlog (2) k)
Use-KMP-to-judge-string-match
- 用KMP算法判断正则表达式是否匹配，“？”匹配任意字符，“*”匹配一个或多个任意字符-KMP algorithm to determine whether the regular expression match, " ?" Matches any character, " *" matches one or more arbitrary characters
Chain
- 单链表的各种重要操作,虽然简单但都是能够节省时间的现成代码，已在VS2010上运行通过-the use of chain
huiwen
- 该程序利用栈以及队列的基本知识，如：入栈，出栈等判断输入的字符串是否为回文。-The program utilizes the basic knowledge of the stack and queue, such as: the stack, the stack judgments input string is palindrome.
PT-01---Packet-Tracer-Activity-(.pka)-Files---Acc
- Convenience class to deal with audio focus. This class deals with everything related to audio * focus: it can request and abandon focus, and will intercept focus change events and deliver * them to a MusicFocusable interface (which, in our case
xml
- 将输入的xml代码格式化输出。比如<html></html> 输出 <html> </html>-The input xml code formatting output. For example <html> </ html> Output <html> </ html>
checkcharscorrect
- 2、 设计算法判断一个算术表达式的圆括号是否正确配对。 第一个式子： 1*(2+3*(4*(2-1)*(3+x)+5)-6) 能够正确匹配 第二个式子： 1*(2+3*4*(2-1)*(3+x)+5)-6) 不能够正确匹配 -Design algorithm to determine an arithmetic expression in parentheses is correct pairing. The first equation: 1* (2+3* (4* (2-1)*
01dongtaiguihua
- 0-1背包问题的动态规划算法，算法分析与设计-0-1 knapsack problem dynamic programming algorithm, algorithm analysis and design
tu
- 数据结构,哈工大数据结构第三次实验,图求最小单元路径。-Data structure HIT data structure of the third experiment, Figure Find the smallest unit path .
01tanxin
- 0-1背包问题的贪心算法，算法分析与设计-0-1 knapsack problem of the greedy algorithm, algorithm analysis and design
Projects
- Tree，STACK，Queue，Heap及CIR_LK_LIST等数据结构的实现与实例。-Realization of the Tree, STACK, Queue, Heap and CIR_LK_LIST data structure instance.
Data-compacting
- 这是几篇关于数据精简的比较好的文献，主要包括八叉树和K邻近法等精简算法-This is a few article about data compacting better literature, mainly including octree and K adjacent method simplified algorithm