LeetCode #780 - Reaching Points

最新推荐文章于 2022-08-22 11:53:57 发布

LawFile

最新推荐文章于 2022-08-22 11:53:57 发布

阅读量161

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/LawFile/article/details/86688486

版权

LeetCode 专栏收录该内容

625 篇文章 1 订阅

订阅专栏

题目描述：

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].

class Solution {
public:
    bool reachingPoints(int sx, int sy, int tx, int ty) {
        while(tx>sx&&ty>sy) //当tx<=sx或者ty<=sx说明不能再迭代了
        {
            if(tx==ty) break; //因为x和y都是正数，所以一旦x==y说明不能再迭代了
            //tx>ty，说明tx是由ty加之前的tx得到的，为了得到最初的tx，令tx%=ty
            else if(tx>ty) tx%=ty;
            else ty%=tx;
        }
        if(tx==sx) return (ty-sy)%tx==0;
        if(ty==sy) return (tx-sx)%ty==0;
        return false;
    }
};