rev digits by rec
123456789101112131415161718192021
# using recursion to reverse a number
# the sum way
# f(1425) = 5 + f(142), 2 + f(14), 4+ f(1), 1+f(0)
# def reverse(n):
# rev1(n)
def rev2(n):
digits = len(str(n))
return helper(n,digits)
def helper(n,digits):
if n%10 == n:
return n
rem = n%10
return rem*(10**(digits-1)) + helper(int(n/10),digits-1)
def palind(n):
if n == rev2(n):
return True
return False
print(palind(123432))
Python
INFO