/*
1.正整数
2.12321,121,122221长度为奇、偶数位,翻转后与原值一致;
*/
public static boolean isPalindrome(int x) {
int rev = 0;
if (x < 0 || (x % 10 == 0 && x != 0))
return false;
while (x > rev) {
rev = rev * 10 + x % 10;
x/=10;
}
return (rev == x || (rev / 10 == x));
}
回文数
最新推荐文章于 2023-07-25 18:26:35 发布