搜索资源列表
KnapsackBTDP
- C#实现动态规划法和回溯法解决01背包问题-C# dynamic programming and backtracking to solve knapsack problem 01
maxSubSequenceSum
- 利用动态规划法（完整）求解最大字段和的问题-Dynamic programming (full) to solve the biggest problem of the field and
K-match
- K-近似匹配，动态规划法。输入两个文本和编辑距离k，找出k以内的文本匹配情况。代码很短短，没有相当算法功底很难看懂。最好参考经典的算法设计书籍。-K-approximate matching, dynamic programming method. Two input text and edit distance k, find k within the text to match. The code is a short, not quite algorithms foundation is
water-cPP
- 用动态规划规划法解决水库调度问题，c语言编程，可以运行，有参考意义-Solve reservoir operation problem using dynamic programming planning method, c programming language, you can run, reference
code
- 对于各种问题的动态规划法c语言编程，田忌赛马问题，排列问题等等，内容详细-C language programming for a variety of problems dynamic programming method, Tian Ji Jockey problems, arrangement problems, and so detailed content
tudifenge
- 将一个数分成最少几个数的平方和，利用动态规划法求解-A number divided into at least several square and using dynamic programming method