Cost of a planned route
A route is a list of legs; each leg has a distance and a per-kilometre rate. Sum the cost of the whole route.
- A leg contributes distance × rate.
- An empty route costs zero.
route_cost(legs: list<Leg>) → int
Where you start
def route_cost(legs: list[Leg]) -> int:
Worked examples
| Call | Result |
|---|---|
route_cost([Leg(distance=10, rate=5), Leg(distance=4, rate=8)]) | 82 |
route_cost([Leg(distance=1, rate=1000)]) | 1000 |
route_cost([]) | 0 |
route_cost([Leg(distance=0, rate=500)]) | 0 |
Hint
Multiply per leg and add.
Reference solution in Python
def route_cost(legs: list[Leg]) -> int:
return sum(leg.distance * leg.rate for leg in legs)