algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-19 10:48:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

[mypy] Fix type annotations for dynamic programming (#4687)

Browse Source 
* Fix mypy error for knapsack.py

* Fix mypy error for longest_increasing_subsequence

* Fix mypy error for fractional_knapsack_2.py
This commit is contained in:
imp
2021-09-03 17:49:23 +08:00
committed by GitHub
parent 757d4fb84f
commit c1b15a86ba
3 changed files with 7 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
dynamic_programming/fractional_knapsack_2.py
View File

@ -7,7 +7,7 @@ from __future__ import annotations
def fractional_knapsack(
value: list[int], weight: list[int], capacity: int
) -> tuple[int, list[int]]:
) -> tuple[float, list[float]]:
"""
>>> value = [1, 3, 5, 7, 9]
>>> weight = [0.9, 0.7, 0.5, 0.3, 0.1]
@ -32,8 +32,8 @@ def fractional_knapsack(
ratio = [v / w for v, w in zip(value, weight)]
index.sort(key=lambda i: ratio[i], reverse=True)
max_value = 0
fractions = [0] * len(value)
max_value: float = 0
fractions: list[float] = [0] * len(value)
for i in index:
if weight[i] <= capacity:
fractions[i] = 1
@ -48,13 +48,6 @@ def fractional_knapsack(
if __name__ == "__main__":
n = int(input("Enter number of items: "))
value = input(f"Enter the values of the {n} item(s) in order: ").split()
value = [int(v) for v in value]
weight = input(f"Enter the positive weights of the {n} item(s) in order: ".split())
weight = [int(w) for w in weight]
capacity = int(input("Enter maximum weight: "))
import doctest
max_value, fractions = fractional_knapsack(value, weight, capacity)
print("The maximum value of items that can be carried:", max_value)
print("The fractions in which the items should be taken:", fractions)
doctest.testmod()