diff options
author | Jack Sangdahl <[email protected]> | 2025-09-03 21:37:16 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-09-03 21:37:16 -0600 |
commit | 4efcf3f8df8a89adbef6018a9d2b9c1a2fee7ddf (patch) | |
tree | bdaf45d8d196e4713493c4a934a7d43953b8c87c /find_closest_person.c | |
parent | 5fff803ed8249b8e151791102f19f7ac0d8db4c4 (diff) | |
download | leetcode-4efcf3f8df8a89adbef6018a9d2b9c1a2fee7ddf.tar.gz leetcode-4efcf3f8df8a89adbef6018a9d2b9c1a2fee7ddf.zip |
3516. find closest person
Diffstat (limited to 'find_closest_person.c')
-rw-r--r-- | find_closest_person.c | 22 |
1 files changed, 22 insertions, 0 deletions
diff --git a/find_closest_person.c b/find_closest_person.c new file mode 100644 index 0000000..109df33 --- /dev/null +++ b/find_closest_person.c @@ -0,0 +1,22 @@ +// 3516. Find Closest Person +#include "leetcode.h" + +/* + * you are given three integers represnting the positions of three people on a + * number line. 'x' is the position of person 1, 'y' is the position of person + * 2, and 'z' is the position of persion 3 who does not move. both person 1 and + * person 2 move toward person 3 at the same speed. determine which person will + * reach person 3 first. return 1 if person 1 will arrive first, return 2 if + * person 2 will arrive first, and 0 if both arrive at the same time. + */ + +int findClosest(int x, int y, int z) { + int a = abs(x - z), b = abs(y - z); + return (a != b) << (a > b); +} + +int main() { + printf("%d\n", findClosest(2, 7, 4)); // expect: 1 + printf("%d\n", findClosest(2, 5, 6)); // expect: 2 + printf("%d\n", findClosest(1, 5, 3)); // expect: 0 +} |