LeetCode 780. Reaching Points
Posted Dylan_Java_NYC
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode 780. Reaching Points相关的知识,希望对你有一定的参考价值。
原题链接在这里:https://leetcode.com/problems/reaching-points/
题目:
A move consists of taking a point (x, y)
and transforming it to either (x, x+y)
or (x+y, y)
.
Given a starting point (sx, sy)
and a target point (tx, ty)
, return True
if and only if a sequence of moves exists to transform the point (sx, sy)
to (tx, ty)
. Otherwise, return False
.
Examples: Input: sx = 1, sy = 1, tx = 3, ty = 5 Output: True Explanation: One series of moves that transforms the starting point to the target is: (1, 1) -> (1, 2) (1, 2) -> (3, 2) (3, 2) -> (3, 5) Input: sx = 1, sy = 1, tx = 2, ty = 2 Output: False Input: sx = 1, sy = 1, tx = 1, ty = 1 Output: True
Note:
sx, sy, tx, ty
will all be integers in the range[1, 10^9]
.
题解:
Try reducing tx and ty to sx and sy.
When ty > tx, then the last operation must be tx + val = ty. While(ty > tx) ty - = tx. We could replace by ty %= tx.
Vice versa.
Just check if we could track back to tx = sx, ty = sy + k * sx. Vice versa.
AC Java:
1 class Solution { 2 public boolean reachingPoints(int sx, int sy, int tx, int ty) { 3 while(tx > sx && ty > sy){ 4 if(ty > tx){ 5 ty %= tx; 6 }else{ 7 tx %= ty; 8 } 9 } 10 11 return sx == tx && sy <= ty && (ty - sy) % sx == 0 || 12 (sy == ty && sx <= tx && (tx - sx) % sy == 0); 13 } 14 }
以上是关于LeetCode 780. Reaching Points的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode 780 到达终点[数学] HERODING的LeetCode之路
ProxySQL 排错 Max connect timeout reached while reaching hostgroup 10 after 10000ms
24-780 Engineering Computation
骁龙778G和骁龙780G差别大不大 骁龙778G和骁龙780G选哪个好