Leetcode Problem 1728. Cat and Mouse II

1728. Cat and Mouse II

Leetcode Solutions

Initialize a memoization table to store the outcome of game states.
Define the DFS function that takes the current positions of the cat and mouse, and the number of turns taken so far.
If the current state is already in the memoization table, return the stored result.
If the number of turns exceeds the threshold, return false (cat wins).
If the mouse reaches the food or the cat catches the mouse, return the appropriate outcome.
On the mouse's turn, explore all possible moves the mouse can make. If any move leads to a winning state, return true.
On the cat's turn, explore all possible moves the cat can make. If any move leads to a losing state for the mouse, return false.
Store the result in the memoization table and return it.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen