Update DynamicProgramming/MinimumSumPartition.java

tribbleofjim · realDuYuanChao · web-flow · commit 880240c9081d · 2020-09-06T16:52:41.000+08:00
Co-authored-by: Du Yuanchao &lt;shellhub.me@gmail.com&gt;
diff --git a/DynamicProgramming/MinimumSumPartition.java b/DynamicProgramming/MinimumSumPartition.java
@@ -20,7 +20,7 @@
 import java.io.*;
 public class MinimumSumPartition
 {
-	public static int subSet(int arr[]){
+	public static int subSet(int[] arr) {
         int n = arr.length;
         int sum = getSum(arr);
         boolean dp[][] = new boolean[n+1][sum+1];

Original file line number	Diff line number	Diff line change
`@@ -20,7 +20,7 @@`
`20`	`20`	`import java.io.*;`
`21`	`21`	`public class MinimumSumPartition`
`22`	`22`	`{`
`23`		`- public static int subSet(int arr[]){`
	`23`	`+ 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];`