check-if-point-is-reachable

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

There exists an infinitely large grid. You are currently at point <code>(1, 1)</code>, and you need to reach the point <code>(targetX, targetY)</code> using a finite number of steps.

In one step, you can move from point <code>(x, y)</code> to any one of the following points:

<ul>
	<li><code>(x, y - x)</code></li>
	<li><code>(x - y, y)</code></li>
	<li><code>(2 * x, y)</code></li>
	<li><code>(x, 2 * y)</code></li>
</ul>

Given two integers <code>targetX</code> and <code>targetY</code> representing the X-coordinate and Y-coordinate of your final position, return <code>true</code> if you can reach the point from <code>(1, 1)</code> using some number of steps, and <code>false</code> otherwise.

&nbsp;
Example 1:

<pre>
Input: targetX = 6, targetY = 9
Output: false
Explanation: It is impossible to reach (6,9) from (1,1) using any sequence of moves, so false is returned.
</pre>

Example 2:

<pre>
Input: targetX = 4, targetY = 7
Output: true
Explanation: You can follow the path (1,1) -&gt; (1,2) -&gt; (1,4) -&gt; (1,8) -&gt; (1,7) -&gt; (2,7) -&gt; (4,7).
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= targetX, targetY&nbsp;&lt;= 109</code></li>
</ul>

isReachable

Check if Point Is Reachable

Reaching Points

reaching-points

到达终点

Check if the Rectangle Corner Is Reachable

check-if-the-rectangle-corner-is-reachable

判断矩形的两个角落是否可达

Math

Number Theory

给你一个无穷大的网格图。一开始你在&nbsp;<code>(1, 1)</code>&nbsp;，你需要通过有限步移动到达点&nbsp;<code>(targetX, targetY)</code>&nbsp;。

每一步&nbsp;，你可以从点&nbsp;<code>(x, y)</code>&nbsp;移动到以下点之一：

<ul>
	<li><code>(x, y - x)</code></li>
	<li><code>(x - y, y)</code></li>
	<li><code>(2 * x, y)</code></li>
	<li><code>(x, 2 * y)</code></li>
</ul>

给你两个整数&nbsp;<code>targetX</code> 和&nbsp;<code>targetY</code>&nbsp;，分别表示你最后需要到达点的 X 和 Y 坐标。如果你可以从&nbsp;<code>(1, 1)</code>&nbsp;出发到达这个点，请你返回<code>true</code> ，否则返回&nbsp;<code>false</code>&nbsp;。

&nbsp;

示例 1：

<pre>输入：targetX = 6, targetY = 9
输出：false
解释：没法从 (1,1) 出发到达 (6,9) ，所以返回 false 。
</pre>

示例 2：

<pre>输入：targetX = 4, targetY = 7
输出：true
解释：你可以按照以下路径到达：(1,1) -&gt; (1,2) -&gt; (1,4) -&gt; (1,8) -&gt; (1,7) -&gt; (2,7) -&gt; (4,7) 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= targetX, targetY&nbsp;&lt;= 109</code></li>
</ul>