3830. Find Closest Person
My accepted Python solution to LeetCode problem 3830, Find Closest Person, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.1MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 0ms, memory 17.1MB, accepted 2025-12-30.
class Solution:
def findClosest(self, x: int, y: int, z: int) -> int:
d1 = abs(x - z)
d2 = abs(y - z)
if d1 < d2:
return 1
elif d2 < d1:
return 2
return 0