mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-15 01:40:49 +08:00
Update DynamicProgramming/MinimumSumPartition.java
Co-authored-by: Du Yuanchao <shellhub.me@gmail.com>
This commit is contained in:
@ -20,7 +20,7 @@ import java.lang.*;
|
|||||||
import java.io.*;
|
import java.io.*;
|
||||||
public class MinimumSumPartition
|
public class MinimumSumPartition
|
||||||
{
|
{
|
||||||
public static int subSet(int arr[]){
|
public static int subSet(int[] arr) {
|
||||||
int n = arr.length;
|
int n = arr.length;
|
||||||
int sum = getSum(arr);
|
int sum = getSum(arr);
|
||||||
boolean dp[][] = new boolean[n+1][sum+1];
|
boolean dp[][] = new boolean[n+1][sum+1];
|
||||||
|
Reference in New Issue
Block a user