Skip to content

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

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Oct 8, 2023
Merged

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

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
5ee6465
Add doctests, type hints; fix bug
hollowcrust Oct 7, 2023
32b7f30
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Oct 7, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
24 changes: 21 additions & 3 deletions dynamic_programming/minimum_partition.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,21 +3,33 @@
"""


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):
dp[0][i] = False

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]]
Expand All @@ -28,3 +40,9 @@ def find_min(arr):
break

return diff


if __name__ == "__main__":
from doctest import testmod

testmod()