Update DynamicProgramming/MinimumSumPartition.java

tribbleofjim · realDuYuanChao · web-flow · commit 6fdd9c90dab2 · 2020-09-06T16:53:17.000+08:00
Co-authored-by: Du Yuanchao &lt;shellhub.me@gmail.com&gt;
diff --git a/DynamicProgramming/MinimumSumPartition.java b/DynamicProgramming/MinimumSumPartition.java
@@ -24,7 +24,7 @@ public static int subSet(int[] arr) {
         int n = arr.length;
         int sum = getSum(arr);
         boolean[][] dp = new boolean[n + 1][sum + 1];
-        for(int i = 0; i < n; i++){
+        for (int i = 0; i <= n; i++) {
             dp[i][0] = true;
         }
         for(int j = 0; j < sum; j++){

Original file line number	Diff line number	Diff line change
`@@ -24,7 +24,7 @@ public static int subSet(int[] arr) {`
`24`	`24`	`int n = arr.length;`
`25`	`25`	`int sum = getSum(arr);`
`26`	`26`	`boolean[][] dp = new boolean[n + 1][sum + 1];`
`27`		`- for(int i = 0; i < n; i++){`
	`27`	`+ for (int i = 0; i <= n; i++) {`
`28`	`28`	`dp[i][0] = true;`
`29`	`29`	`}`
`30`	`30`	`for(int j = 0; j < sum; j++){`