[LeetCode]Cheapest Flights Within K Stops@Python

Cheapest Flights Within K Stops

There are n cities connected by m flights. Each fight starts from city u and arrives at v with a price w.
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 src to dst with up to k stops. If there is no such route, output -1.

Example

Example 1:
Input:
n = 3, edges = [[0,1,100],[1,2,100],[0,2,500]]
src = 0, dst = 2, k = 1
Output: 200

Solution

#dijkstra
import collections
class Solution:
    def findCheapestPrice(self, n: int, flights: List[List[int]], src: int, dst: int, K: int) -> int:
        graph = collections.defaultdict(dict)
        for i,j,k in flights:
            graph[i][j] = k
        heap = [(0, src, K+1)]
        while heap:
            i, j, k = heapq.heappop(heap)
            if j==dst:
                return i
            if k>0:
                for p in graph[j]:
                    heapq.heappush(heap, (i+graph[j][p], p, k-1))
        return -1

#DP
class Solution:
    def findCheapestPrice(self, n: int, flights: List[List[int]], src: int, dst: int, K: int) -> int:
        INF=float('inf')
        mn=[INF]*n
        mn[src]=0
        
        for k in range(K+1):
            newmn=mn[:]
            for (a,b, cost) in flights:
                newmn[b]=min(newmn[b],mn[a]+cost)
            mn=newmn
            
        return mn[dst] if mn[dst]!=INF else -1