资源列表
longest_common_subsequence
- 求出所有最长公共子序列（连续序列） 输入： malose malmose 输出： lcs_length=3 lcs_string=ose lcs_string=mal-ouput all the longest common subsequences. the subsequence must be series. for example: [input] malose malmose [output] lcs_length=3 lcs_stri
kangkaidedajiangjiang
- POJ题目BUCTOJ更为经典欢迎广大ACMer交流经验-POJ subject BUCTOJ more classical exchange of experience welcome ACMer
BITREE1
- 利用C语言来实现树的各种操作，树的各种排序 等等操作-Using C language to implement the various operations the tree, the tree operations of various sort, etc.
EditPDistance
- edit distance.字符串之间编译距离，包括插入，删除，替换。 -edit distance
3
- 汉诺塔，数据结构作业，耿国华编著，第三章的内容，-Tower of Hanoi, data structures, operations, Guo-Hua Geng edited
cs
- 基于压缩感知匹配追踪算法对一维数据的恢复-Matching Pursuit algorithm based on compressed sensing for one-dimensional data recovery
Queenquestion
- 这是c语言的初学者容易看见的一个程序。国际象棋里的皇后问题。-This is the c language, easy for beginners to see a program. Chess queen inside the issue.
MY_QUICK
- 1. Pick an element, called a pivot, from the list. 2. Reorder the list so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it (equal values can go either way
zuichangzixulie
- 序列Z=<B，C，D，B>是序列X=<A，B，C，B，D，A，B>的子序列，相应的递增下标序列为<2，3，5，7>。-Sequence Z = < B, C, D, B > is sequence X = < A, B, C, B, D, A, B > son sequence, the corresponding sequence for increasing subscr ipt < 2 consecutie hc-posit
hash
- 散列查找法范例，当你需要的时候，可以适当修改下，就可以用，fortran语言-Hashing method to find an example, when you need it, can, under appropriate modifications, you can use, fortran language
yue
- 实现磁盘寻址最优化问题，这是使用在算法分析与设计当中，利用贪心算法实现的最优问题-Disk addressing optimization problems
yuesefu--wanggong
- 设编号为1,2, … ,n(n>0)的n个人顺时针方向一圈,每人持有一个正整数密码,开始时,任意给出一个报数上限值，从第一个人开始顺时针方向自1起顺序报数,报到m时停止报数,报m的人出列,将他的密码作新的m值,从他顺时针方向上的下一个人重新自1起顺序报数 如此下去,直到所有人全部出列为止.要求设计一个程序模拟此过程，并给出出列人的序列。-Let numbered 1,2, ..., n (n> 0) of n individuals clockwise circle, each ho