Reaching Points Problem


Description

LeetCode Problem 780.

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:

1
2
3
4
5
6
7
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:

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

Example 3:

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

Constraints:

  • 1 <= sx, sy, tx, ty <= 10^9


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution {
public:
    bool reachingPoints(int sx, int sy, int tx, int ty) {
        if (tx < sx || ty < sy) 
            return false;
        
        if (tx == sx && ty == sy) 
            return true;
        
        if (tx == sx) 
            return (ty - sy) % tx == 0;
    
        if (ty == sy) 
            return (tx - sx) % ty == 0;

        if (tx > ty) 
            return reachingPoints(sx, sy, tx % ty, ty);

        return reachingPoints(sx, sy, tx, ty % tx);
    }
};




Related Posts

Three Equal Parts Problem

LeetCode 927. You are given an array arr which consists...

Surface Area Of 3D Shapes Problem

LeetCode 892. You are given an n x n grid...

Super Palindromes Problem

LeetCode 906. Let’s say a positive integer is a super-palindrome...

Smallest Range I Problem

LeetCode 908. You are given an integer array nums and...

Projection Area Of 3D Shapes Problem

LeetCode 883. You are given an n x n grid...

Prime Palindrome Problem

LeetCode 866. Given an integer n, return the smallest prime...