mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 16:54:50 +08:00
Merge pull request #33 from nanhuaibeian/nanhuaibeian-patch-1
添加1049.最后一块石头的重量 Java版本
This commit is contained in:
@ -155,7 +155,27 @@ public:
|
|||||||
|
|
||||||
|
|
||||||
Java:
|
Java:
|
||||||
|
```Java
|
||||||
|
class Solution {
|
||||||
|
public int lastStoneWeightII(int[] stones) {
|
||||||
|
int sum = 0;
|
||||||
|
for (int i : stones) {
|
||||||
|
sum += i;
|
||||||
|
}
|
||||||
|
int target = sum >> 1;
|
||||||
|
//初始化dp数组
|
||||||
|
int[] dp = new int[target + 1];
|
||||||
|
for (int i = 0; i < stones.length; i++) {
|
||||||
|
//采用倒序
|
||||||
|
for (int j = target; j >= stones[i]; j--) {
|
||||||
|
//两种情况,要么放,要么不放
|
||||||
|
dp[j] = Math.max(dp[j], dp[j - stones[i]] + stones[i]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return sum - 2 * dp[target];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
Python:
|
Python:
|
||||||
|
|
||||||
|
Reference in New Issue
Block a user