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

解题思路：

这个题的关键点是，如果 ty > tx，那么必然是从 (tx, ty-tx)到达(tx, ty)这个状态的。

递减直到ty - yx < tx ;

ty < tx同理

class Solution {
public:
    bool reachingPoints(int sx, int sy, int tx, int ty) 
    {
        while(tx >= sx && ty >= sy)
        {
            if(tx == sx && ty == sy) return true ;
            
            if(tx == sx)
            {
                if((ty - sy) % tx == 0) return true ;
                else return false ;
            }
            else if(ty == sy)
            {
                if((tx - sx) % ty == 0) return true ;
                else return false ;
            }
            else if(tx >= ty)
            {
                tx %= ty ;
            }
            else if(tx < ty)
            {
                ty %= tx ;
            }
        }
        
        return false ;
    }
};