def int2str(n):
digist= {0:'0',1:'1',2:'2',3:'3',4:'4',5:'5',6:'6',7:'7',8:'8',9:'9'}
m = n
str2 = ''
while m >= 10:
list1 = m%10
str2 += digist[list1]
m = m // 10 # //为整除
str2 += digist[m]
return str2[::-1]
def is_recle(n):
s = int2str(n)
if s[:] == s[::-1]:
return s
Sign in to make a reply
是瑞瑞喔
def int2str(n):
digist= {0:'0',1:'1',2:'2',3:'3',4:'4',5:'5',6:'6',7:'7',8:'8',9:'9'}
m = n
str2 = ''
while m >= 10:
list1 = m%10
str2 += digist[list1]
m = m // 10 # //为整除
str2 += digist[m]
return str2[::-1]
def is_recle(n):
s = int2str(n)
if s[:] == s[::-1]:
return s