判断整型数字是否是回文的两种实现形式,要求不能申请额外的空间,不考虑负数
1.来自leetcode
public boolean isPalindrome(int x) {
if(x<0||(x!=0 && x%10==0))
return false;
int rev = 0;
while(x>rev){
rev = rev*10 +x%10;
x = x/10;
}
return (x==rev||x==rev/10);
}
2.
public boolean isPalindrome(int n) {
int m = reverse(n);
if (m == n&&m>=0)
return true;
else
return false;
}
public static int reverse(int i) {
int s, j = 0;
s = i;
while (s != 0) {
j = j * 10 + s % 10;
s = s / 10;
}
return j;
}