LeetCode 780: Reaching Points
Problem Restatement We are given four integers: sx, sy, tx, ty The starting point is: (sx, sy) The target point is: (tx, ty) From any point (x, y) , we may perform one of two moves: (x, y) -> (x + y, y) (x, y) -> (x, x + y) Return True if we can reach (tx, ty) from (sx, sy) . Otherwise, return False . Input and Output Item...