n cities connected by
m flights. Each flight starts from city
u and arrives at
v with a price
Now given all the cities and flights, together with starting city
src and the destination
dst, your task is to find the cheapest price from
dst with up to
k stops. If there is no such route, output
- The number of nodes
nwill be in range
[1, 100], with nodes labeled from
n - 1.
- The size of
flightswill be in range
[0, n * (n - 1) / 2].
- The format of each flight will be
(src, dst, price).
- The price of each flight will be in the range
kis in the range of
[0, n - 1].
- There will not be any duplicated flights or self cycles.