mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:43:04 +08:00
添加了二维数组版本,相比于一维好理解
This commit is contained in:
@ -153,6 +153,8 @@ public:
|
||||
|
||||
|
||||
Java:
|
||||
|
||||
一维数组版本
|
||||
```Java
|
||||
class Solution {
|
||||
public int lastStoneWeightII(int[] stones) {
|
||||
@ -173,6 +175,41 @@ class Solution {
|
||||
return sum - 2 * dp[target];
|
||||
}
|
||||
}
|
||||
```
|
||||
二维数组版本(便于理解)
|
||||
```Java
|
||||
class Solution {
|
||||
public int lastStoneWeightII(int[] stones) {
|
||||
int sum = 0;
|
||||
for (int s : stones) {
|
||||
sum += s;
|
||||
}
|
||||
|
||||
int target = sum / 2;
|
||||
//初始化,dp[i][j]为可以放0-i物品,背包容量为j的情况下背包中的最大价值
|
||||
int[][] dp = new int[stones.length][target + 1];
|
||||
//dp[i][0]默认初始化为0
|
||||
//dp[0][j]取决于stones[0]
|
||||
for (int j = stones[0]; j <= target; j++) {
|
||||
dp[0][j] = stones[0];
|
||||
}
|
||||
|
||||
for (int i = 1; i < stones.length; i++) {
|
||||
for (int j = 1; j <= target; j++) {//注意是等于
|
||||
if (j >= stones[i]) {
|
||||
//不放:dp[i - 1][j] 放:dp[i - 1][j - stones[i]] + stones[i]
|
||||
dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - stones[i]] + stones[i]);
|
||||
} else {
|
||||
dp[i][j] = dp[i - 1][j];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
System.out.println(dp[stones.length - 1][target]);
|
||||
return (sum - dp[stones.length - 1][target]) - dp[stones.length - 1][target];
|
||||
}
|
||||
}
|
||||
|
||||
```
|
||||
|
||||
Python:
|
||||
|
Reference in New Issue
Block a user