Improved task 416.

javadev · web-flow · commit 64d8a2e38874 · 2022-12-29T14:44:33.000+02:00
diff --git a/src/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java b/src/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java
@@ -9,12 +9,10 @@ public boolean canPartition(int[] nums) {
         for (int num : nums) {
             sums += num;
         }
-        // odd
-        if ((sums % 2) == 1) {
+        if (sums % 2 == 1) {
             return false;
         }
         sums /= 2;
-        int n = nums.length;
         boolean[] dp = new boolean[sums + 1];
         dp[0] = true;
         for (int num : nums) {

Original file line number	Diff line number	Diff line change
`@@ -9,12 +9,10 @@ public boolean canPartition(int[] nums) {`
`9`	`9`	`for (int num : nums) {`
`10`	`10`	`sums += num;`
`11`	`11`	`}`
`12`		`- // odd`
`13`		`- if ((sums % 2) == 1) {`
	`12`	`+ if (sums % 2 == 1) {`
`14`	`13`	`return false;`
`15`	`14`	`}`
`16`	`15`	`sums /= 2;`
`17`		`- int n = nums.length;`
`18`	`16`	`boolean[] dp = new boolean[sums + 1];`
`19`	`17`	`dp[0] = true;`
`20`	`18`	`for (int num : nums) {`