Merge pull request #1389 from Jerry-306/patch-61

0494.目标和 新增typescript版本代码
This commit is contained in:
程序员Carl
2022-06-23 10:27:39 +08:00
committed by GitHub

View File

@ -351,22 +351,26 @@ const findTargetSumWays = (nums, target) => {
}; };
``` ```
TypeScript
```typescript TypeScript:
```ts
function findTargetSumWays(nums: number[], target: number): number { function findTargetSumWays(nums: number[], target: number): number {
const sum: number = nums.reduce((pre, cur) => pre + cur); // 把数组分成两个组合left, right.left + right = sum, left - right = target.
if (Math.abs(target) > sum) return 0; const sum: number = nums.reduce((a: number, b: number): number => a + b);
if ((target + sum) % 2 === 1) return 0; if ((sum + target) % 2 || Math.abs(target) > sum) return 0;
const bagSize: number = (target + sum) / 2; const left: number = (sum + target) / 2;
const dp: number[] = new Array(bagSize + 1).fill(0);
dp[0] = 1; // 将问题转化为装满容量为left的背包有多少种方法
for (let i = 0; i < nums.length; i++) { // dp[i]表示装满容量为i的背包有多少种方法
for (let j = bagSize; j >= nums[i]; j--) { const dp: number[] = new Array(left + 1).fill(0);
dp[0] = 1; // 装满容量为0的背包有1种方法什么也不装
for (let i: number = 0; i < nums.length; i++) {
for (let j: number = left; j >= nums[i]; j--) {
dp[j] += dp[j - nums[i]]; dp[j] += dp[j - nums[i]];
} }
} }
return dp[bagSize]; return dp[left];
}; };
``` ```