Reaching points

Math

34.2% acceptance

Feb 21, 2026

1585

238

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

Solution

Rust

Time O(n)

Space O(1)

LeetCode

solution.rs

/*
 * 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:
 * 1 <= sx, sy, tx, ty <= 109
 */
impl Solution {
  pub fn reaching_points(sx: i32, sy: i32, mut tx: i32, mut ty: i32) -> bool {
    while tx >= sx && ty >= sy {
      if tx == sx && ty == sy { return true; }
      if tx > ty {
        if ty == sy { return (tx - sx) % ty == 0; }
        tx %= ty;
      } else {
        if tx == sx { return (ty - sy) % tx == 0; }
        ty %= tx;
      }
    }
    false
  }
}