leetcode刷题第二天
9. Palindrome Number
Example 1:
Input: 121
Output: true
Example 2:
Input: -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
Example 3:
Input: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
代码:
public static boolean isPalindrome(int x) {
if(x==0)
return true;
if(x<0 || (x % 10 == 0 && x != 0))
return false;
int temp = x;
int sum = 0;
while(temp!=0) {
sum = sum *10 + temp % 10;
temp = temp /10;
}
return (x==sum);
}