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

psf/black code formatting (#1277)

Browse Source
This commit is contained in:
William Zhang
2019-10-05 01:14:13 -04:00
committed by Christian Clauss
parent 07f04a2e55
commit 9eac17a408
291 changed files with 6014 additions and 4571 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
dynamic_programming/sum_of_subset.py
View File

@ -1,34 +1,35 @@
def isSumSubset(arr, arrLen, requiredSum):
# a subset value says 1 if that subset sum can be formed else 0
#initially no subsets can be formed hence False/0
subset = ([[False for i in range(requiredSum + 1)] for i in range(arrLen + 1)])
# initially no subsets can be formed hence False/0
subset = [[False for i in range(requiredSum + 1)] for i in range(arrLen + 1)]
#for each arr value, a sum of zero(0) can be formed by not taking any element hence True/1
# for each arr value, a sum of zero(0) can be formed by not taking any element hence True/1
for i in range(arrLen + 1):
subset[i][0] = True
#sum is not zero and set is empty then false
# sum is not zero and set is empty then false
for i in range(1, requiredSum + 1):
subset[0][i] = False
for i in range(1, arrLen + 1):
for j in range(1, requiredSum + 1):
if arr[i-1]>j:
subset[i][j] = subset[i-1][j]
if arr[i-1]<=j:
subset[i][j] = (subset[i-1][j] or subset[i-1][j-arr[i-1]])
if arr[i - 1] > j:
subset[i][j] = subset[i - 1][j]
if arr[i - 1] <= j:
subset[i][j] = subset[i - 1][j] or subset[i - 1][j - arr[i - 1]]
#uncomment to print the subset
# uncomment to print the subset
# for i in range(arrLen+1):
# print(subset[i])
return subset[arrLen][requiredSum]
arr = [2, 4, 6, 8]
requiredSum = 5
requiredSum = 5
arrLen = len(arr)
if isSumSubset(arr, arrLen, requiredSum):
print("Found a subset with required sum")
else:
print("No subset with required sum")
print("No subset with required sum")