StarMirror/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Merge pull request #550 from aaaaaabiao/patch-1

Browse Source 
leetcode解题修改-划分数组为和相等的两部分
This commit is contained in:
CyC2018 2019-01-25 12:12:34 +08:00 committed by GitHub
commit 68da17c813
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 0 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
docs/notes/Leetcode 题解.md
View File

@ -3050,7 +3050,6 @@ public boolean canPartition(int[] nums) {
int W = sum / 2; int W = sum / 2;
boolean[] dp = new boolean[W + 1]; boolean[] dp = new boolean[W + 1];
dp[0] = true; dp[0] = true;
Arrays.sort(nums);
for (int num : nums) { // 0-1 背包一个物品只能用一次 for (int num : nums) { // 0-1 背包一个物品只能用一次
for (int i = W; i >= num; i--) { // 从后往前，先计算 dp[i] 再计算 dp[i-num] for (int i = W; i >= num; i--) { // 从后往前，先计算 dp[i] 再计算 dp[i-num]
dp[i] = dp[i] || dp[i - num]; dp[i] = dp[i] || dp[i - num];