Algorithm
Mirror Distance of an Integer
Solution
class Solution:
def reverse(self, n: int) -> int:
res = 0
while n > 0:
res = res * 10 + n % 10
n //= 10
return res
def mirrorDistance(self, n: int) -> int:
return abs(n - self.reverse(n))Video GuideLeetcode Daily
Time Complexity
O(log n)
Space Complexity
O(1)