方法1:
c
#include <stdio.h>
int main(void){
int i=0,j,k=1,n,a[20];
scanf("%d",&n);
while(n) {a[i]=n%10;n/=10;i++;}
for(j=0;j<i/2;j++)
if(a[j]!=a[i-j-1])
{
k=0;
break;
}
k?printf("是回文"):printf("不是回文");
return 0;
}
方法2:
python
#coding=utf-8
def is_palindrome(n):
str_n = str(n)
return str_n == str_n[-1::-1]
#test
output = filter(is_palindrome,range(1,1000))
print(list(output))