The King's Walk
On an unbounded chessboard, a king moves one square in any of 8 directions. Print the minimum moves from (r1, c1) to (r2, c2).
Input: one line with four integers r1 c1 r2 c2.
Output: Chebyshev distance: max(|Δr|, |Δc|).
Constraints:
- |coordinates| ≤ 109
Sample Tests
Input 1
1 1 4 3
Output 1
3
Input 2
2 2 2 2
Output 2
0
Discussion (opens after you solve — no spoilers before)
No comments yet.