queens-that-can-attack-the-king

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

On a 0-indexed <code>8 x 8</code> chessboard, there can be multiple black queens and one white king.

You are given a 2D integer array <code>queens</code> where <code>queens[i] = [xQueeni, yQueeni]</code> represents the position of the <code>ith</code> black queen on the chessboard. You are also given an integer array <code>king</code> of length <code>2</code> where <code>king = [xKing, yKing]</code> represents the position of the white king.

Return the coordinates of the black queens that can directly attack the king. You may return the answer in any order.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2022/12/21/chess1.jpg" style="width: 400px; height: 400px;" />
<pre>
Input: queens = [[0,1],[1,0],[4,0],[0,4],[3,3],[2,4]], king = [0,0]
Output: [[0,1],[1,0],[3,3]]
Explanation: The diagram above shows the three queens that can directly attack the king and the three queens that cannot attack the king (i.e., marked with red dashes).
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2022/12/21/chess2.jpg" style="width: 400px; height: 400px;" />
<pre>
Input: queens = [[0,0],[1,1],[2,2],[3,4],[3,5],[4,4],[4,5]], king = [3,3]
Output: [[2,2],[3,4],[4,4]]
Explanation: The diagram above shows the three queens that can directly attack the king and the three queens that cannot attack the king (i.e., marked with red dashes).
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= queens.length &lt; 64</code></li>
	<li><code>queens[i].length == king.length == 2</code></li>
	<li><code>0 &lt;= xQueeni, yQueeni, xKing, yKing &lt; 8</code></li>
	<li>All the given positions are unique.</li>
</ul>

queensAttacktheKing

Queens That Can Attack the King

Minimum Moves to Capture The Queen

minimum-moves-to-capture-the-queen

捕获黑皇后需要的最少移动次数

Array

Matrix

Simulation

在一个 下标从 0 开始 的 <code>8 x 8</code> 棋盘上，可能有多个黑皇后和一个白国王。

给你一个二维整数数组 <code>queens</code>，其中 <code>queens[i] = [xQueeni, yQueeni]</code> 表示第 <code>i</code> 个黑皇后在棋盘上的位置。还给你一个长度为 <code>2</code> 的整数数组 <code>king</code>，其中 <code>king = [xKing, yKing]</code> 表示白国王的位置。

返回 能够直接攻击国王的黑皇后的坐标。你可以以 任何顺序 返回答案。

&nbsp;

示例 1：

<img alt="" src="https://pic.leetcode.cn/1703052515-HqjAJq-chess1.jpg" style="width: 400px; height: 400px;" />

<pre>
输入：queens = [[0,1],[1,0],[4,0],[0,4],[3,3],[2,4]], king = [0,0]
输出：[[0,1],[1,0],[3,3]]
解释：上面的图示显示了三个可以直接攻击国王的皇后和三个不能攻击国王的皇后（用红色虚线标记）。
</pre>

示例 2：

<img alt="" src="https://pic.leetcode.cn/1703052660-bPPflt-chess2.jpg" style="width: 400px; height: 400px;" />

<pre>
输入：queens = [[0,0],[1,1],[2,2],[3,4],[3,5],[4,4],[4,5]], king = [3,3]
输出：[[2,2],[3,4],[4,4]]
解释：上面的图示显示了三个能够直接攻击国王的黑皇后和三个不能攻击国王的黑皇后（用红色虚线标记）。</pre>

&nbsp;

提示：

<ul>
	<li><meta charset="UTF-8" /><code>1 &lt;= queens.length &lt; 64</code></li>
	<li><code>queens[i].length == king.length == 2</code></li>
	<li><code>0 &lt;= xQueeni, yQueeni, xKing, yKing &lt; 8</code></li>
	<li>所有给定的位置都是 唯一 的。</li>
</ul>