Minimum Moves to Reach Target in Grid
You are given four integers sx, sy, tx, and ty, representing two points (sx, sy) and (tx, ty) on an infinitely large 2D grid.
You are given four integers sx, sy, tx, and ty, representing two points (sx, sy) and (tx, ty) on an infinitely large 2D grid.
You start at (sx, sy).
At any point (x, y), define m = max(x, y). You can either:
Return the minimum number of moves required to reach (tx, ty). If it is impossible to reach the target, return -1.
Example 1
Input: sx = 1, sy = 2, tx = 5, ty = 4
Output: 2
Explanation: The optimal path is: Thus, the minimum number of moves to reach (5, 4) is 2.
Example 2
Input: sx = 0, sy = 1, tx = 2, ty = 3
Output: 3
Explanation: The optimal path is: Thus, the minimum number of moves to reach (2, 3) is 3.
Example 3
Input: sx = 1, sy = 1, tx = 2, ty = 2
Output: -1
Constraints
- 0 <= sx <= tx <= 10^9
- 0 <= sy <= ty <= 10^9
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.