algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 02:53:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1388 from Jerry-306/patch-60

Browse Source 
1049.最后一块石头重量 新增typescript版本代码
This commit is contained in:
程序员Carl
2022-06-23 10:25:51 +08:00
committed by GitHub
parent 04e2d27754 1a89d3c64e
commit 6bf645a23e
1 changed files with 15 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
problems/1049.最后一块石头的重量II.md
View File

@ -277,26 +277,29 @@ var lastStoneWeightII = function (stones) {
};
```
TypeScript：
```typescript
TypeScript版本
```ts
function lastStoneWeightII(stones: number[]): number {
const sum: number = stones.reduce((pre, cur) => pre + cur);
const bagSize: number = Math.floor(sum / 2);
const weightArr: number[] = stones;
const valueArr: number[] = stones;
const goodsNum: number = weightArr.length;
const dp: number[] = new Array(bagSize + 1).fill(0);
for (let i = 0; i < goodsNum; i++) {
for (let j = bagSize; j >= weightArr[i]; j--) {
dp[j] = Math.max(dp[j], dp[j - weightArr[i]] + valueArr[i]);
const sum: number = stones.reduce((a: number, b:number): number => a + b);
const target: number = Math.floor(sum / 2);
const n: number = stones.length;
// dp[j]表示容量（总数和）为j的背包所能装下的数（下标[0, i]之间任意取）的总和（<= 容量）的最大值
const dp: number[] = new Array(target + 1).fill(0);
for (let i: number = 0; i < n; i++ ) {
for (let j: number = target; j >= stones[i]; j--) {
dp[j] = Math.max(dp[j], dp[j - stones[i]] + stones[i]);
}
}
return sum - dp[bagSize] * 2;
return sum - dp[target] - dp[target];
};
```
-----------------------
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>