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

Optimised Space Complexity To O(sum) (#5651)

Browse Source 
* Optimised Space Complexity To O(sum)

* Fixes Clang Format

* Optimised Space Complexity To Use a Single DP Array
This commit is contained in:
Sanketh L Reddy
2024-10-09 19:27:11 +05:30
committed by GitHub
parent 0603accfd4
commit 2d34bc150f
1 changed files with 13 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
src/main/java/com/thealgorithms/dynamicprogramming/SubsetSum.java
View File

@ -9,28 +9,25 @@ public final class SubsetSum {
*
* @param arr the array containing integers.
* @param sum the target sum of the subset.
* @return {@code true} if a subset exists that sums to the given value, otherwise {@code false}.
* @return {@code true} if a subset exists that sums to the given value,
* otherwise {@code false}.
*/
public static boolean subsetSum(int[] arr, int sum) {
int n = arr.length;
boolean[][] isSum = new boolean[n + 1][sum + 1];
// Initialize the first column to true since a sum of 0 can always be achieved with an empty subset.
for (int i = 0; i <= n; i++) {
isSum[i][0] = true;
}
// Initialize a single array to store the possible sums
boolean[] isSum = new boolean[sum + 1];
// Fill the subset sum matrix
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= sum; j++) {
if (arr[i - 1] <= j) {
isSum[i][j] = isSum[i - 1][j] || isSum[i - 1][j - arr[i - 1]];
} else {
isSum[i][j] = isSum[i - 1][j];
}
// Mark isSum[0] = true since a sum of 0 is always possible with 0 elements
isSum[0] = true;
// Iterate through each Element in the array
for (int i = 0; i < n; i++) {
// Traverse the isSum array backwards to prevent overwriting values
for (int j = sum; j >= arr[i]; j--) {
isSum[j] = isSum[j] || isSum[j - arr[i]];
}
}
return isSum[n][sum];
return isSum[sum];
}
}