搜索资源列表
zuichanggonggzixulei
- 应用动态规划法求解两个字串的最长公共自序列及其长度-dynamic programming method for two of the longest string since the public sequence and length
LCS070621
- 用动态规划法实现查找两字符串的公共子序列。是算法中的一个重要问题。-use dynamic programming search for two strings to achieve the public sequences. The algorithm is an important issue.
背包问题的解决
- 背包问题的解决 :给定一个超递增序列和一个背包的容量,然后在超递增序列中选(只能选一次)或不选每一个数值,使得选中...解决0/1背包问题的方法有多种,最常用的有贪婪法和动态规划法。
ship
- 用动态规划法实现装载问题，对初学者有很大的帮助
Algorithm
- 数据结构算法 分治算法、贪心算法、动态规划法、回溯法、分治定界法
matrixChain
- 动态规划法解矩阵连乘积的最优计算次序问题。按照分解最优解的结构，建立递归关系，计算最优值，构造最优解4个步骤
0-1背包问题
- 动态规划法解决0-1背包问题
MatrixMultiply
- 算法设计与分析 王晓东版的 矩阵连乘的动态规划法和备忘录法的实现-Algorithm Design and Analysis Xiaodong version of the matrix continued by the dynamic programming method and the realization of Memorandum of Law
analysys-and-design-of-algorithm-ppt
- 我上课用的计算机算法设计与分析的电子教案，内容包括了最基本的分治法，贪心法，动态规划法，-I class computer algorithms used in design and analysis of electronic lesson plans, including the most basic sub-rule law, greedy method, dynamic programming method,
KnapsackProblem
- 0/1背包问题的几种解法，包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
car
- 算法分析中的经典问题之动态规划法汽车加油问题，应用VC++编写的C源码-Algorithm analysis of the classic problems of the dynamic programming vehicle refueling, the application VC++ source code written in C
longest
- 算法分析中动态规划法的经典例子，最长公子序列问题。VC++编写的C源码-Algorithm analysis, a classic example of dynamic programming, the longest sequence of the problem son. VC++ source code written in C
knapsack
- MFC写的用动态规划法解决0-1背包问题。-solve 0-1 knapsack problem using dynamic programming.
DynamicProgramming
- 用递归法、动态规划法、备忘录方法实现矩阵连乘。-algorithms:Dynamic Programming in JAVA
dynamic
- 动态规划法解决经典背包问题，C语言实现。-Classic dynamic programming method to solve the knapsack problem, C language.
01knapsack
- 01背包动态规划法的cpp文件 直接可用-01 knapsack dynamic programming
comparision--of-two-algorithms
- 对动态规划法和贪心法的分析和比较,通过比较研究来分析各算法的特点。-Analysis and comparision with two algorithms
stones-combined
- 动态规划法是求解最优化问题的一种方法，该文主要研究其求解问题的基本思想及具体步骤，详细分析其用于石子合并问题上的算法设计，并给出其算法实现。-Dynamic programming to solve optimization problems is a method of solving the problem of its major research paper the basic ideas and concrete steps, a detailed analysis of the me
pratice
- 用动态规划法解最长公共子序列
最长递增子序列
- 利用动态规划法求出，时间复杂度为O(N*2)