even-number-of-knight-moves

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given two integer arrays <code>start</code> and <code>target</code>, where each array is of the form <code>[x, y]</code> representing a cell on a standard 8 x 8 chessboard.

Return <code>true</code> if a knight can move from <code>start</code> to <code>target</code> in an even number of moves. Otherwise, return <code>false</code>.

Note: A valid knight move consists of moving two squares in one direction and one square perpendicular to it. The figure below illustrates all eight possible moves from a cell.

<img src="https://assets.leetcode.com/uploads/2018/10/12/knight.png" style="height: 200px; width: 200px;" />

&nbsp;
Example 1:

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

Output: true

Explanation:

One possible sequence of moves is <code>(1, 1) -&gt; (3, 2) -&gt; (2, 4) -&gt; (4, 3) -&gt; (2, 2)</code>.

The knight reaches the target in 4 moves, which is even. Thus, the answer is <code>true</code>.
</div>

Example 2:

<div class="example-block">
Input: start = [4,5], target = [6,6]

Output: false

Explanation:​​​​​​​

It is impossible to reach <code>target = [6, 6]</code> from <code>start = [4, 5]</code> in an even number of moves. Thus, the answer is <code>false</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>start.length == target.length == 2</code></li>
	<li><code>0 &lt;= start[i], target[i] &lt;= 7</code></li>
</ul>

第 511 场周赛

weekly-contest-511

canReach

中级工程师

Even Number of Knight Moves

Array

Math

给你两个整数数组 <code>start</code> 和 <code>target</code>，每个数组的形式均为 <code>[x, y]</code>，表示标准 8 x 8 国际象棋棋盘上的一个格子。

如果骑士可以用&nbsp;偶数&nbsp;次移动从 <code>start</code> 到达 <code>target</code>，则返回 <code>true</code>；否则返回 <code>false</code>。

注意：骑士的一次合法移动是：沿一个方向移动两格，再沿与其垂直的方向移动一格。下图展示了骑士从一个格子出发时所有 8 种可能的移动方式。

<img src="https://assets.leetcode.com/uploads/2018/10/12/knight.png" style="height: 200px; width: 200px;" />

&nbsp;

示例 1：

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

输出： true

解释：

一种可行的移动序列为 <code>(1, 1) -&gt; (3, 2) -&gt; (2, 4) -&gt; (4, 3) -&gt; (2, 2)</code>。

骑士经过 4 次移动到达目标位置，4 是偶数。因此答案为 <code>true</code>。
</div>

示例 2：

<div class="example-block">
输入： start = [4,5], target = [6,6]

输出： false

解释：

骑士无法用偶数次移动从 <code>start = [4, 5]</code> 到达 <code>target = [6, 6]</code>。因此答案为 <code>false</code>。
</div>

&nbsp;

提示：

<ul>
	<li><code>start.length == target.length == 2</code></li>
	<li><code>0 &lt;= start[i], target[i] &lt;= 7</code></li>
</ul>