Leetcode Problem 1824. Minimum Sideway Jumps

1824. Minimum Sideway Jumps

Leetcode Solutions

Initialize a 2D array dp of size n+1 by 3 with infinity, except for dp[0][1] which is set to 0 since the frog starts at lane 2 (1-indexed) with no side jumps.
Iterate through each point i from 1 to n.
For each lane j from 1 to 3, check if there is no obstacle at point i on lane j and at point i-1 on lane j.
If there is no obstacle, update dp[i][j] to be the minimum of its current value and dp[i-1][j] (no side jump required).
For each lane j, if there is an obstacle at point i on lane j, update dp[i][j] to be infinity.
For each lane j, update dp[i][j] to be the minimum of its current value and the minimum side jumps required to reach any of the other two lanes at point i-1 plus one (for the side jump).
After filling the dp array, the answer is the minimum value in dp[n].
Return the minimum value in dp[n] as the final answer.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen