Leetcode学习笔记:#9. Palindrome Number
Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
实现:
public boolean isPalindrome(int n){
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);
思路:
循环,判断reverse后的n的一半是否与另一半相等。如果n是奇数,则除以10,即不判断最中间的数字,只判断中间数字两边的数。