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.py | |
parent | 5fff803ed8249b8e151791102f19f7ac0d8db4c4 (diff) | |
download | leetcode-4efcf3f8df8a89adbef6018a9d2b9c1a2fee7ddf.tar.gz leetcode-4efcf3f8df8a89adbef6018a9d2b9c1a2fee7ddf.zip |
3516. find closest person
Diffstat (limited to 'find_closest_person.py')
-rw-r--r-- | find_closest_person.py | 29 |
1 files changed, 29 insertions, 0 deletions
diff --git a/find_closest_person.py b/find_closest_person.py new file mode 100644 index 0000000..0e687d3 --- /dev/null +++ b/find_closest_person.py @@ -0,0 +1,29 @@ +# 3516. Find Closest Person + +""" +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. +""" + + +class Solution(object): + def findClosest(self, x, y, z): + """ + :type x: int + :type y: int + :type z: int + :rtype: int + """ + a, b = abs(x - z), abs(y - z) + return (a != b) << (a > b) + + +if __name__ == "__main__": + obj = Solution() + print(obj.findClosest(2, 7, 4)) + print(obj.findClosest(2, 5, 6)) + print(obj.findClosest(1, 5, 3)) |