minimum-queen-moves-to-reach-target

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

There is an <code>8 x 8</code> empty chessboard with 1-indexed rows and columns.

You are given an array <code>source = [sr, sc]</code> representing the starting position of a queen, and an array <code>target = [tr, tc]</code> representing the target position.

In one move, the queen travels one or more squares along a single row, column, or diagonal, staying within the board.

Return the minimum number of moves for the queen to land exactly on <code>target</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: source = [8,1], target = [1,8]

Output: 1

Explanation:

​​​​​​​<img alt="" src="https://assets.leetcode.com/uploads/2026/08/31/111.png" style="width: 300px; height: 303px;" />​​​​​​​

A single diagonal move takes the queen straight from <code>(8, 1)</code> to <code>(1, 8)</code>.
</div>

Example 2:

<div class="example-block">
Input: source = [4,2], target = [1,3]

Output: 2

Explanation:

<img alt="" src="https://assets.leetcode.com/uploads/2026/09/14/1e602ed4-c525-4be4-a6a9-6804cb7d2a55.png" style="width: 300px; height: 305px;" />​​​​​​​

The queen moves from <code>(4, 2)</code> to <code>(4, 3)</code>, then from <code>(4, 3)</code> to <code>(1, 3)</code>, reaching the target in 2 moves.
</div>

Example 3:

<div class="example-block">
Input: source = [1,1], target = [1,1]

Output: 0

Explanation:

The queen is already at the target position, so no moves are needed.
</div>

&nbsp;
Constraints:​​​​​​​

<ul>
	<li><code>source == [sr, sc]</code></li>
	<li><code>target == [tr, tc]</code></li>
	<li><code>1 &lt;= sr, sc, tr, tc &lt;= 8</code></li>
</ul>

第 192 场双周赛

biweekly-contest-192

minQueenMoves

中级工程师

Minimum Queen Moves to Reach Target

一个 <code>8 x 8</code> 的空棋盘，其行和列的下标从 1 开始。

给你一个数组 <code>source = [sr, sc]</code> 表示&nbsp;皇后&nbsp;的初始位置，以及一个数组 <code>target = [tr, tc]</code> 表示目标位置。

在一步移动中，皇后可以在棋盘范围内，沿着单条&nbsp;行&nbsp;、&nbsp;列&nbsp;或&nbsp;对角线&nbsp;移动一个或多个方格。

返回皇后移动到&nbsp;恰好&nbsp;落在 <code>target</code> 位置所需的&nbsp;最小&nbsp;移动次数。

&nbsp;

示例 1：

<div class="example-block">
输入： source = [8,1], target = [1,8]

输出： 1

解释：

<img alt="" src="https://assets.leetcode.com/uploads/2026/08/31/111.png" style="width: 300px; height: 303px;" />

单次对角线移动即可让皇后直接从 <code>(8, 1)</code> 移动到 <code>(1, 8)</code>。
</div>

示例 2：

<div class="example-block">
输入： source = [4,2], target = [1,3]

输出： 2

解释：

<img alt="" src="https://assets.leetcode.com/uploads/2026/09/14/1e602ed4-c525-4be4-a6a9-6804cb7d2a55.png" style="width: 300px; height: 305px;" />​​​​​​​

皇后先从 <code>(4, 2)</code> 移动到 <code>(4, 3)</code>，然后从 <code>(4, 3)</code> 移动到 <code>(1, 3)</code>，共用 2 步移动到达目标位置。
</div>

示例 3：

<div class="example-block">
输入： source = [1,1], target = [1,1]

输出： 0

解释：

皇后已经处于目标位置，因此不需要任何移动。
</div>

&nbsp;

提示：​​​​​​​

<ul>
	<li><code>source == [sr, sc]</code></li>
	<li><code>target == [tr, tc]</code></li>
	<li><code>1 &lt;= sr, sc, tr, tc &lt;= 8</code></li>
</ul>