leetCode 9.Palindrome Number (回文数字) 解题思路和方法

Determine whether an integer is a palindrome. Do this without extra space.

click to show spoilers.

Some hints:
Could negative integers be palindromes? (ie, -1)

If you are thinking of converting the integer to string, note the restriction of using extra space.

You could also try reversing an integer. However, if you have solved the problem "Reverse Integer", you know 

that the reversed integer might overflow. How would you handle such case?

There is a more generic way of solving this problem.

思路：题目要求不需额外空间，其他的已无要求。算法上很简单，本文提供两种解法，一种是将数字转成字符串，然后从中心向两边判断是否相等，不相等则直接返回false;

另一种解法是反转数字，与初始比较，相等返回true,不相等返回false. 解法2的效率比解法1稍微高一些。

其实还有一种思路，是反转数字，同时从首尾向中间逐步比较相对的两位数是否相等，不相等直接返回false。本文没有实现，读者可自行实现。

解法1代码：

public class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0){
            return false;
        }
        else if(x < 10){
            return true;
        }
        else{
            String s = x + "";
            int len = s.length();
            int i,j;
            //长度为偶数len>=2
            if((len & 1) == 0){
                j = len/2;
                i = j-1;
                while(i >= 0){
                   if(s.charAt(i) != s.charAt(j)){
                       return false;
                   }
                   else{
                       i--;
                       j++;
                   }
                }
            }
            //长度为奇数len>=3
            else{
                i = len/2 - 1;
                j = i+2;
                while(i >= 0){
                   if(s.charAt(i) != s.charAt(j)){
                       return false;
                   }
                   else{
                       i--;
                       j++;
                   }
                }
            }
            return true;
        }
    }
}

解法2代码：

public class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0){
            return false;
        }
        else if(x < 10){
            return true;
        }
        else{
            int y = 0;
            int z = x;
            while(x != 0){
                y = y*10 + x%10;
                x /= 10;
            }
            if(z != y)
                return false;
            else
                return true;
            
        }
    }
}