Update DynamicProgramming/MinimumSumPartition.java

tribbleofjim · realDuYuanChao · web-flow · commit 695123086281 · 2020-09-06T16:53:45.000+08:00
Co-authored-by: Du Yuanchao &lt;shellhub.me@gmail.com&gt;
diff --git a/DynamicProgramming/MinimumSumPartition.java b/DynamicProgramming/MinimumSumPartition.java
@@ -47,7 +47,7 @@ else if(arr[i-1] == j){
         }
 
         // fill the index array
-        int index[] = new int[sum];
+        int[] index = new int[sum];
         int p = 0;
         for (int i = 0; i <= sum / 2; i++) {
             if (dp[n][i]) {
