mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-12 04:18:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Adding doctests for sum_of_subset.py (#1333)

Browse Source
This commit is contained in:
Jigyasa G 2019-10-11 23:59:50 +05:30 committed by John Law
parent ea47ae2932
commit e678879892
1 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
dynamic_programming/sum_of_subset.py
View File

@ -1,5 +1,10 @@
def isSumSubset(arr, arrLen, requiredSum): def isSumSubset(arr, arrLen, requiredSum):
"""
>>> isSumSubset([2, 4, 6, 8], 4, 5)
False
>>> isSumSubset([2, 4, 6, 8], 4, 14)
True
"""
# a subset value says 1 if that subset sum can be formed else 0 # a subset value says 1 if that subset sum can be formed else 0
# initially no subsets can be formed hence False/0 # initially no subsets can be formed hence False/0
subset = [[False for i in range(requiredSum + 1)] for i in range(arrLen + 1)] subset = [[False for i in range(requiredSum + 1)] for i in range(arrLen + 1)]
@ -22,14 +27,9 @@ def isSumSubset(arr, arrLen, requiredSum):
# uncomment to print the subset # uncomment to print the subset
# for i in range(arrLen+1): # for i in range(arrLen+1):
# print(subset[i]) # print(subset[i])
print(subset[arrLen][requiredSum])
return subset[arrLen][requiredSum] if __name__ == "__main__":
import doctest
doctest.testmod()
arr = [2, 4, 6, 8]
requiredSum = 5
arrLen = len(arr)
if isSumSubset(arr, arrLen, requiredSum):
print("Found a subset with required sum")
else:
print("No subset with required sum")