9.Palindrome Number
Description
Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
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.
Follow up:
Coud you solve it without converting the integer to a string?
Solution: (Java)
class Solution {
public boolean isPalindrome(int x) {
if (x < 0)
return false;
List<Integer>list = new ArrayList<Integer>();
int last;
while (x != 0) {
last = x % 10;
x = x / 10;
list.add(last);
}
int len = list.size();
for (int i = 0; i < len/2; i++) {
if (!list.get(i).equals(list.get(len-i-1)))
return false;
}
return true;
}
}
思路
本题直接 reverse 这个整数可能会溢出,最简单的解法是直接通过 String 的 reverse 方法,判断前后两个字符串是否相等即可。题意貌似引导我们不要用转为字符串处理的方法。这里通过将整数的每一位取出来保存在 List 当中,然后头尾依次比较即可。题目本身较简单。
看到有另一种思路,既然直接 reverse 这个整数可能会溢出,那么可以将这个整数以中间为对称轴分为两个整数,将右边的 reverse 后与左边原来的进行比较,看是否相等,则不会出现溢出的情况。需要注意处理以0结尾的整数,特别是两位数的。代码如下:
public boolean isPalindrome2(int x) {
if(x < 0 || (x % 10 == 0 && x != 0)) {
return false;
}
int revertedNumber = 0;
while(x > revertedNumber) {
revertedNumber = revertedNumber * 10 + x % 10;
x /= 10;
}
return x == revertedNumber || x == revertedNumber/10;
}