输入一个整数n(1 <= n <= 100000)
从1开始按从小到大的顺序输出所有回文数
10
1 2 3 4 5 6 7 8 9
n = int(input()) def isHuiwen(num): pos = str(num) reverse = pos[::-1] if pos == reverse: return True else: return False for i in range(1, n+1): if i < 10: print(i, end='\n') else: is_huiwen = isHuiwen(i) if is_huiwen: print(i, end='\n')
n = eval(input()) for i in range(1,n+1): s = str(i) if(s == s[::-1]): print(s)
for i in range(1, int(input())+1): if str(i) == str(i)[::-1]: print(i)
n = int(input()) for i in range(1,n+1): if str(i) == str(i)[::-1]: print (i) else: x = 1 #没什么用 就是为了不影响循环哈哈
这道题你会答吗?花几分钟告诉大家答案吧!
扫描二维码,关注牛客网
下载牛客APP,随时随地刷题