bool is_palindrome(int n) {
int t = n, r = 0;
while (t > 0) {
r = r * 10 + t % 10;
t /= 10;
}
return r == n;
}
判断回文数
最新推荐文章于 2024-09-14 22:25:23 发布
bool is_palindrome(int n) {
int t = n, r = 0;
while (t > 0) {
r = r * 10 + t % 10;
t /= 10;
}
return r == n;
}