Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    780 - Reaching Points\.

    Hard

    Given four integers sx, sy, tx, and ty, return true if it is possible to convert the point (sx, sy) to the point (tx, ty) through some operations_, or_ false otherwise.

    The allowed operation on some point (x, y) is to convert it to either (x, x + y) or (x + y, y).

    Example 1:

    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)

    Example 2:

    Input: sx = 1, sy = 1, tx = 2, ty = 2

    Output: false

    Example 3:

    Input: sx = 1, sy = 1, tx = 1, ty = 1

    Output: true

    Constraints:

    • <code>1 <= sx, sy, tx, ty <= 10<sup>9</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
    • Field Summary

      Fields 
      Modifier and Type Field Description
    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()
    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description
    • Method Summary

      Modifier and Type Method Description
      final Boolean reachingPoints(Integer sx, Integer sy, Integer tx, Integer ty)
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait