Leetcode Problem 1197. Minimum Knight Moves

1197. Minimum Knight Moves

Leetcode Solutions

Initialize a queue and add the starting point (0, 0) with a step count of 0.
Initialize a visited set to keep track of visited squares.
While the queue is not empty, process the nodes in the queue: a. Dequeue the current square and step count from the queue. b. If the current square is the target [x, y], return the step count. c. Otherwise, iterate over all possible knight moves from the current square. d. For each move, if the new square has not been visited, add it to the queue with a step count incremented by 1 and mark it as visited.
Continue this process until the target is reached.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen