mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 16:54:50 +08:00
@ -219,7 +219,28 @@ func max(a, b int) int {
|
|||||||
}
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
|
JavaScript版本
|
||||||
|
|
||||||
|
```javascript
|
||||||
|
/**
|
||||||
|
* @param {number[]} stones
|
||||||
|
* @return {number}
|
||||||
|
*/
|
||||||
|
var lastStoneWeightII = function (stones) {
|
||||||
|
let sum = stones.reduce((s, n) => s + n);
|
||||||
|
|
||||||
|
let dpLen = Math.floor(sum / 2);
|
||||||
|
let dp = new Array(dpLen + 1).fill(0);
|
||||||
|
|
||||||
|
for (let i = 0; i < stones.length; ++i) {
|
||||||
|
for (let j = dpLen; j >= stones[i]; --j) {
|
||||||
|
dp[j] = Math.max(dp[j], dp[j - stones[i]] + stones[i]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return sum - dp[dpLen] - dp[dpLen];
|
||||||
|
};
|
||||||
|
```
|
||||||
|
|
||||||
-----------------------
|
-----------------------
|
||||||
* 作者微信:[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)
|
* 作者微信:[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)
|
||||||
|
Reference in New Issue
Block a user