Update Leetcode 题解.md

2019-01-25 11:53:01 +08:00 · 2019-01-25 11:53:01 +08:00 · 4643cdcc9f
commit 4643cdcc9f
parent 7fd67bd80b
1 changed files with 0 additions and 1 deletions
--- a/docs/notes/Leetcode
+++ b/docs/notes/Leetcode
@ -3050,7 +3050,6 @@ public boolean canPartition(int[] nums) {
    int W = sum / 2;
    boolean[] dp = new boolean[W + 1];
    dp[0] = true;
-    Arrays.sort(nums);
    for (int num : nums) {                 // 0-1 背包一个物品只能用一次
        for (int i = W; i >= num; i--) {   // 从后往前，先计算 dp[i] 再计算 dp[i-num]
            dp[i] = dp[i] || dp[i - num];