Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update MinimumSumPartition.java

Browse Source 
fix code issue
This commit is contained in:
tribbleofjim 2020-09-06 12:31:11 +08:00 committed by GitHub
parent 6f9d13bfed
commit e7193aab8a
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 69 additions and 52 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

99
DynamicProgramming/MinimumSumPartition.java
View File

@ -20,56 +20,73 @@ import java.lang.*;
import java.io.*;
public class MinimumSumPartition
{
public static void main (String[] args)
{
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
while(t-->0)
{
int n = sc.nextInt();
int arr[] = new int[n];
int sum = 0;
for(int i = 0;i < n;i++)
{
arr[i] = sc.nextInt();
sum += arr[i];
}
int ans[] = new int[sum];
ans = subset(arr,sum);
int min = Integer.MAX_VALUE;
for (int i = 0; i < ans.length; i++)
min = Math.min(min,(sum-2*ans[i]));
System.out.println(min);
}
sc.close();
}
static int[] subset(int arr[],int sum)
{
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 i = 1; i <= sum; i++)
dp[0][i] = false;
// subset sum concept
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= sum; j++)
{
if(arr[i-1] <= j)
dp[i][j] = dp[i-1][j-arr[i-1]] || dp[i-1][j];
else
}
for(int j = 0; j < sum; j++){
dp[0][j] = false;
}
//fill dp array
for(int i = 1; i <= n; i++){
for(int j = 1; j <= sum; j++){
if(arr[i-1] < j){
dp[i][j] = dp[i-1][j - arr[i-1]] || dp[i-1][j];
}
else if(arr[i-1] == j){
dp[i][j] = true;
}
else{
dp[i][j] = dp[i-1][j];
}
}
//storing last dp column whose value is true till sum/2
}
// fill the index array
int index[] = new int[sum];
int p = 0;
for(int i = 0 ; i <= sum / 2; i++)
{
if(dp[n][i] == true)
for(int i = 0; i <= sum / 2; i++){
if(dp[n][i]){
index[p++] = i;
}
return index;
}
return getMin(index, sum);
}
public static int getSum(int arr[]){
if(arr.length <= 0){
return 0;
}
int sum = 0;
for(int i = 0; i < arr.length; i++){
sum += arr[i];
}
return sum;
}
public static int getMin(int arr[], int sum){
if(arr.length <= 0){
return 0;
}
int min = Integer.MAX_VALUE;
for(int i = 0; i < arr.length; i++){
min = Math.min(min, (sum - 2*arr[i]));
}
return min;
}
public static void main(String args[]){
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int arr[] = new int[n];
for(int i = 0 ; i<n; i++){
arr[i] = in.nextInt();
}
System.out.println(subSet(arr));
}
}