[LeetCode] Find Closest Person

3516. Find Closest Person

You are given three integers x, y, and z, representing the positions of three people on a number line:

  • x is the position of Person 1.
  • y is the position of Person 2.
  • z is the position of Person 3, who does not move.

Both Person 1 and Person 2 move toward Person 3 at the same speed.

Determine which person reaches Person 3 first:

  • Return 1 if Person 1 arrives first.
  • Return 2 if Person 2 arrives first.
  • Return 0 if both arrive at the same time.

Return the result accordingly.

1
2
3
4
5
6
7
class Solution {
public:
int findClosest(int x, int y, int z) {
int xz = abs(x-z), yz = abs(y-z);
return xz < yz ? 1 : xz > yz ? 2 : 0;
}
};
Author: Song Hayoung
Link: https://songhayoung.github.io/2025/04/14/PS/LeetCode/find-closest-person/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.