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

思路：从前往后算可能性很多，从后往前算只有一种可能性

Every parent point (x, y) has two children, (x, x+y) and (x+y, y). However, every point (x, y) only has one parent candidate (x-y, y) if x >= y, else (x, y-x). This is because we never have points with negative coordinates.

class Solution:
    def reachingPoints(self, sx, sy, tx, ty):
        """
        :type sx: int
        :type sy: int
        :type tx: int
        :type ty: int
        :rtype: bool
        """
        while sx<tx and sy<ty:
            tx, ty = tx%ty, ty%tx
        return sx==tx and (ty-sy)%tx==0 or sy==ty and (tx-sx)%ty==0
        
s=Solution()
print(s.reachingPoints(sx = 10, sy = 2, tx = 2, ty = 11))
print(s.reachingPoints(sx = 1, sy = 1, tx = 3, ty = 5))
print(s.reachingPoints(sx = 1, sy = 1, tx = 2, ty = 2))
print(s.reachingPoints(sx = 1, sy = 1, tx = 1, ty = 1))