介绍动态规划方法在解决背包问题、图象压缩、矩阵乘法链、最短路径、无交叉子集和元件折叠等方面的应用。-on dynamic programming methods in solving knapsack problem, image compression, the matrix multiplication chains, the shortest path, non-overlapping subsets of folding and

介绍动态规划方法在解决背包问题、图象压缩、矩阵乘法链、最短路径、无交叉子集和元件折叠等方面的应用。-on dynamic programming methods in solving knapsack problem, image compression, the matrix multiplication chains, the shortest path, non-overlapping subsets of folding and

本源码的特色是大量使用ajax，动态效果显著 1.DWR实现购物车 2完成了显示功能 3用UL的方式进行显示 4.把东西装入购物车，根据物品的ID 5把购物车里的所有东西都显示出来 6.显示总共的价格-The source is characterized by heavy use of ajax, dynamic 1.DWR realize significant Cart 2 completed displa