Leetcode Problem 787. Cheapest Flights Within K Stops

787. Cheapest Flights Within K Stops

Leetcode Solutions

Create an adjacency list from the flights array.
Initialize a dist array with large values, except for dist[src] which should be 0.
Initialize a queue with the pair {src, 0}.
Set stops to 0.
Perform BFS until the queue is empty or stops > k:
- For each node at the current level, iterate over its neighbors.
- If moving to a neighbor leads to a lower price, update dist for that neighbor and enqueue it.
- After exploring all nodes at the current level, increment stops.
Return dist[dst] if it's not the initial large value; otherwise, return -1.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen