LintCode Backpack II(背包II)
来源:互联网 发布:联创软件集团 编辑:程序博客网 时间:2024/05/06 19:27
原题网址:http://www.lintcode.com/en/problem/backpack-ii/
Given n items with size Ai and value Vi, and a backpack with size m. What's the maximum value can you put into the backpack?
Notice
You cannot divide item into small pieces and the total size of items you choose should smaller or equal to m.
Given 4 items with size [2, 3, 5, 7]
and value [1, 5, 2, 4]
, and a backpack with size10
. The maximum value is 9
.
方法:动态规划,与背包I问题类似。
public class Solution { /** * @param m: An integer m denotes the size of a backpack * @param A & V: Given n items with size A[i] and value V[i] * @return: The maximum value */ public int backPackII(int m, int[] A, int V[]) { // write your code here int[] values = new int[m + 1]; Arrays.fill(values, -1); values[0] = 0; int max = 0; for(int i = 0; i < A.length; i++) { for(int j = m; j >= 0; j--) { if (values[j] != -1 && j + A[i] <= m) { values[j + A[i]] = Math.max(values[j + A[i]], values[j] + V[i]); max = Math.max(max, values[j + A[i]]); } } } return max; }}
0 0
- LintCode Backpack II(背包II)
- 【LintCode】 Backpack II 背包问题II
- Lintcode - Backpack II
- LintCode Backpack(背包)
- 125.Backpack II-背包问题 II(中等题)
- backpack ii
- backpack-ii
- LintCode-背包问题 II
- LintCode : 背包问题 II
- LintCode : 背包问题 II
- LintCode:背包问题 II
- lintcode--背包问题II
- LintCode Backpack III(背包III)
- 【LintCode】Backpack 背包问题
- lintcode backpack 背包问题
- [刷题]Backpack II
- 动态规划------Backpack II
- #125 Backpack II
- Android四大组件之Activity
- java学习总结
- ContentProvider之访问者(二)
- mac ERROR 2002 (HY000): Can't connect to local MySQL server through socket '/tmp/mysql.sock' (2)
- javascript:void(0)
- LintCode Backpack II(背包II)
- Codeforces Round #357 (Div. 2) E. Runaway to a Shadow
- Oracle数据库基础知识
- mono develop-unity 编译脚本失败
- 浅谈href=#与href=javascript:void(0)的区别
- 回归CSDN
- Android audio dai_link详解
- 视觉定位原理:对极几何与基本矩阵
- centos6.6 lamp 安装