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

Merge pull request #1445 from tribbleofjim/patch-1

Browse Source 
Update MinimumSumPartition.java
This commit is contained in:
Du Yuanchao
2020-09-06 17:23:04 +08:00
committed by GitHub
parent 6f9d13bfed 3e727e3ff5
commit f2f42f354c
1 changed files with 69 additions and 52 deletions
Download Patch File Download Diff File Expand all files Collapse all files

121
DynamicProgramming/MinimumSumPartition.java
View File

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