Leetcode Problem 499. The Maze III

499. The Maze III

Leetcode Solutions

Create a priority queue to store nodes with their distance and path from the ball's starting position.
Initialize the priority queue with the starting position of the ball, distance 0, and an empty path.
While the priority queue is not empty, extract the node with the minimum distance.
If the node is the hole, return the path.
If the node has been visited, skip it.
Otherwise, mark the node as visited.
For each direction (up, down, left, right), roll the ball until it hits a wall or the hole, calculating the distance and updating the path.
Add the resulting position, distance, and path to the priority queue if it hasn't been visited.
If the hole is never reached, return 'impossible'.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen