Update DynamicProgramming/MinimumSumPartition.java

Co-authored-by: Du Yuanchao <shellhub.me@gmail.com>
This commit is contained in:
tribbleofjim
2020-09-06 16:52:41 +08:00
committed by GitHub
parent 928f212a4f
commit 880240c908

View File

@ -20,7 +20,7 @@ import java.lang.*;
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];