题解 | 回文对称数
回文对称数
https://www.nowcoder.com/practice/5b143af8328f4e42adf5e10397ae44ef
#include <stdio.h>
int isPalindrom(int num)
{
int reserved = 0;
int original = num;
int i;
while(num)
{
reserved = reserved * 10 + num % 10;
num /= 10;
}
return original == reserved;
}
int main()
{
int n;
scanf("%d",&n);
int i;
for(i = 1; i <= n; i++)
{
if(isPalindrom(i))
{
printf("%d\n",i);
}
}
return 0;
}
查看21道真题和解析