We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent fb81c11 commit 03db285Copy full SHA for 03db285
08_greedy_algorithms/python/01_set_covering.py
@@ -13,8 +13,8 @@
13
while states_needed:
14
best_station = None
15
states_covered = set()
16
- for station, states in stations.items():
17
- covered = states_needed & states
+ for station, states_for_station in stations.items():
+ covered = states_needed & states_for_station
18
if len(covered) > len(states_covered):
19
best_station = station
20
states_covered = covered
0 commit comments