algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-11 22:22:21 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update class name

Browse Source
This commit is contained in:
Stepfen Shawn
2020-08-02 15:21:33 +08:00
committed by GitHub
parent 98428462cd
commit 90f59aa6ac
1 changed files with 33 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files

65
DynamicProgramming/MinimumSumPartition.java
View File

@ -1,3 +1,4 @@
package DynamicProgramming;
// Partition a set into two subsets such that the difference of subset sums is minimum
/*
@ -17,56 +18,56 @@ Subset2 = {36, 40} ; sum of Subset2 = 76
import java.util.*;
import java.lang.*;
import java.io.*;
class GFG
{
public class MinimumSumPartition
{
public static void main (String[] args)
{
Scanner sc=new Scanner(System.in);
int t=sc.nextInt();
{
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++)
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];
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]));
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);
}
}
static int[] subset(int arr[],int sum)
{
int n=arr.length;
boolean dp[][]=new boolean[n+1][sum+1];
for(int i=0;i<=n;i++)
dp[i][0]=true;
for(int i=1;i<=sum;i++)
dp[0][i]=false;
int n = arr.length;
boolean dp[][] = new boolean[n+1][sum+1];
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 i = 1; i <= n; i++)
{
for(int j=1;j<=sum;j++)
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];
if(arr[i-1] <= j)
dp[i][j] = dp[i-1][j-arr[i-1]] || dp[i-1][j];
else
dp[i][j]=dp[i-1][j];
dp[i][j] = dp[i-1][j];
}
}
//storing last dp column whose value is true till sum/2
int index[]=new int[sum];
int p=0;
for(int i=0;i<=sum/2;i++)
int index[] = new int[sum];
int p = 0;
for(int i = 0 ; i <= sum / 2; i++)
{
if(dp[n][i]==true)
index[p++]=i;
if(dp[n][i] == true)
index[p++] = i;
}
return index;
}