from _functools import reduce
def char2num(c): return {'0':0, '1':1, '2':2, '3':3, '4':4, '5':5, '6':6, '7':7, '8':8, '9':9}[c]
def str2int(s): return reduce(lambda x, y: x * 10 + y, map(char2num, s))
def is_palindrome(num): s = list(str(num)) l = len(s) s1 = [] n = 1 while n < l+1 : s1.append(s[-n]) n = n + 1 return num == str2int(s1)
output = filter(is_palindrome, range(1, 1000)) print(list(output))
Sign in to make a reply
Eric_Bao_New
from _functools import reduce
def char2num(c): return {'0':0, '1':1, '2':2, '3':3, '4':4, '5':5, '6':6, '7':7, '8':8, '9':9}[c]
def str2int(s): return reduce(lambda x, y: x * 10 + y, map(char2num, s))
def is_palindrome(num): s = list(str(num)) l = len(s) s1 = [] n = 1 while n < l+1 : s1.append(s[-n]) n = n + 1 return num == str2int(s1)
output = filter(is_palindrome, range(1, 1000)) print(list(output))