leetcode - 787. Cheapest Flights Within K Stops

KpLn_HJL

已于 2024-02-23 13:51:10 修改

阅读量491

点赞数 10

分类专栏： OJ题目记录文章标签： leetcode 算法职场和发展

于 2024-02-23 13:37:25 首次发布

本文链接：https://blog.csdn.net/sinat_41679123/article/details/136254037

版权

OJ题目记录专栏收录该内容

515 篇文章 1 订阅

订阅专栏

Description

There are n cities connected by some number of flights. You are given an array flights where flights[i] = [fromi, toi, pricei] indicates that there is a flight from city fromi to city toi with cost pricei.

You are also given three integers src, dst, and k, return the cheapest price from src to dst with at most k stops. If there is no such route, return -1.

Example 1:
在这里插入图片描述

Input: n = 4, flights = [[0,1,100],[1,2,100],[2,0,100],[1,3,600],[2,3,200]], src = 0, dst = 3, k = 1
Output: 700
Explanation:
The graph is shown above.
The optimal path with at most 1 stop from city 0 to 3 is marked in red and has cost 100 + 600 = 700.
Note that the path through cities [0,1,2,3] is cheaper but is invalid because it uses 2 stops.

Example 2:
在这里插入图片描述

Input: n = 3, flights = [[0,1,100],[1,2,100],[0,2,500]], src = 0, dst = 2, k = 1
Output: 200
Explanation:
The graph is shown above.
The optimal path with at most 1 stop from city 0 to 2 is marked in red and has cost 100 + 100 = 200.

Example 3:
在这里插入图片描述

Input: n = 3, flights = [[0,1,100],[1,2,100],[0,2,500]], src = 0, dst = 2, k = 0
Output: 500
Explanation:
The graph is shown above.
The optimal path with no stops from city 0 to 2 is marked in red and has cost 500.

Constraints:

1 <= n <= 100
0 <= flights.length <= (n * (n - 1) / 2)
flights[i].length == 3
0 <= fromi, toi < n
fromi != toi
1 <= pricei <= 104
There will not be any multiple flights between two cities.
0 <= src, dst, k < n
src != dst

Solution

Thought it’s dijkstra at first, then realized it could be solved using BFS + weighted map.

Edit: oops, this is actually called bellman-ford algorithm.

Time complexity: $o (n)$
Space complexity: $o (n)$

Code

class Solution:
    def findCheapestPrice(self, n: int, flights: List[List[int]], src: int, dst: int, k: int) -> int:
        def build_graph(n: int, edges: list) -> dict:
            graph = {i: {} for i in range(n)}
            for src, dst, price in edges:
                graph[src][dst] = price
            return graph
        # graph: {node: {neighbor1: cost1, neighbor2: cost2, ...}}
        graph = build_graph(n, flights)
        node_cost = {}
        queue = collections.deque([(src, 0, 0)])
        while queue:
            node, cost, step = queue.popleft()
            if node_cost.get(node, float('inf')) < cost or step > k + 1:
                continue
            node_cost[node] = cost
            for each_neighbor, neighbor_cost in graph.get(node, {}).items():
                queue.append((each_neighbor, cost + neighbor_cost, step + 1))
        return node_cost.get(dst, -1)