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