搜索资源列表
Knap12121
- 用动态规划算法编写的有关旅行商问题的java程序-dynamic programming algorithm used in the preparation of the Traveling Salesman Problem java programs
dp
- 动态规划问题的讲义，ppt格式，已经压缩-dynamic programming problem handouts, ppt format has been compressed
maxsubsum
- 几种经典算法实现最大字段和问题（分治算法，动态规划算法）
BagZeroOne
- java语言实现动态规划求解0-1背包问题。
FourPegsHanoi
- 四柱汉诺塔问题，设计并实现一个求解四塔问题的动态规划算法，并分析时间和空间复杂性-Peg Hanoi Tower problem, design and implement a four tower problem solving dynamic programming algorithm, and analyze time and space complexity
knapsack
- knapsack，用动态规划解背包问题，可直接在eclipse上运行。-knapsack, knapsack problem using dynamic programming solution can be directly run in eclipse.
newBag
- 动态规划策略实现0-1背包问题的JAVA源程序-Dynamic planning strategy for the achievement of 0-1 Knapsack Problem JAVA source code
TestKnapsack
- 经典的背包问题用动态规划实现的JAVA代码-Classical knapsack problem using dynamic programming to achieve the JAVA code
Knapsack
- java实现0/1背包问题，算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas.
lhl.java
- 用JAVA语言 动态规划算法解决0/1背包问题-good
yachtP
- JAVA实现动态规划解游艇最少租金问题，内有详细注释。
Queen
- JAVA实现，动态规划算法解N皇后问题。
beibao
- 用java 实现 动态规划求0-1背包问题两个实例 包括改进后的算法实现-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem
perfect
- 用java 实现的动态规划求漂亮打印问题的一个实例-dynamic programming algorithm an example to solve perfect print problem
CoinsChange
- 硬币找零问题 动态规划算法 JAVA源代码-Coin change for the dynamic programming algorithm for Java source code
suanfa
- 用动态规划实现三角问题，用贪心算法实现装在问题和最短源路径问题-Triangle problems using dynamic programming, greedy algorithms installed in the path of the problem and the shortest source
Knapsack2
- 用java实现的01背包问题的动态规划算法，注释很详细，配合《算法导论》的伪代码可以很容易看懂。-01 knapsack problem with java achieve dynamic programming algorithm, very detailed notes, with the " Introduction to Algorithms" pseudo-code can easily understand.
LongCommonSubstrng
- 算法问题，求公共最长自序列，采用动态规划求最优解。-LCS Question DP
beibao
- 文件里面的代码主要是用递归算法，动态规划的算法，贪婪算法，回溯算法解决没有利润分配的背包问题。-File inside the code is mainly used recursive algorithm, dynamic programming algorithms, greedy algorithms, backtracking algorithm to solve knapsack problem is no distribution of profits.
矩阵连乘问题和租船问题
- 动态规划算法解决矩阵连乘问题和租船问题，java源码。(Dynamic programming algorithm to solve matrix multiplication problem and charter problem, java source code.)