mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-10-06 05:39:30 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add doctests, type hints; fix bug for dynamic_programming/minimum_partition.py (#10012)

Browse Source 
* Add doctests, type hints; fix bug

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
This commit is contained in:
hollowcrust 2023-10-08 16:58:48 +08:00 committed by GitHub
parent 895dffb412
commit fa077e6703
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 21 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
dynamic_programming/minimum_partition.py
View File

@ -3,13 +3,25 @@ Partition a set into two subsets such that the difference of subset sums is mini
"""
def find_min(arr):
def find_min(arr: list[int]) -> int:
"""
>>> find_min([1, 2, 3, 4, 5])
1
>>> find_min([5, 5, 5, 5, 5])
5
>>> find_min([5, 5, 5, 5])
0
>>> find_min([3])
3
>>> find_min([])
0
"""
n = len(arr)
s = sum(arr)
dp = [[False for x in range(s + 1)] for y in range(n + 1)]
for i in range(1, n + 1):
for i in range(n + 1):
dp[i][0] = True
for i in range(1, s + 1):
@ -17,7 +29,7 @@ def find_min(arr):
for i in range(1, n + 1):
for j in range(1, s + 1):
dp[i][j] = dp[i][j - 1]
dp[i][j] = dp[i - 1][j]
if arr[i - 1] <= j:
dp[i][j] = dp[i][j] or dp[i - 1][j - arr[i - 1]]
@ -28,3 +40,9 @@ def find_min(arr):
break
return diff
if __name__ == "__main__":
from doctest import testmod
testmod()