Merge pull request #1387 from Jerry-306/patch-59

0416.分割等和子集 新增 typescript 解法代码
This commit is contained in:
程序员Carl
2022-06-22 09:38:15 +08:00
committed by GitHub

View File

@ -417,6 +417,26 @@ var canPartition = function(nums) {
```
TypeScript:
```ts
function canPartition(nums: number[]): boolean {
const sum: number = nums.reduce((a: number, b: number): number => a + b);
if (sum % 2 === 1) return false;
const target: number = sum / 2;
// dp[j]表示容量总数和为j的背包所能装下的数下标[0, i]之间任意取)的总和(<= 容量)的最大值
const dp: number[] = new Array(target + 1).fill(0);
const n: number = nums.length;
for (let i: number = 0; i < n; i++) {
for (let j: number = target; j >= nums[i]; j--) {
dp[j] = Math.max(dp[j], dp[j - nums[i]] + nums[i]);
}
}
return dp[target] === target;
};
```
C:
二维dp
```c
@ -575,6 +595,5 @@ function canPartition(nums: number[]): boolean {
-----------------------
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>