LeetCode-Easy-Java-Palindrome Number

判断整数是否是回文数

个人记录

题目描述：

Determine whether an integer is a palindrome. Do this without extra space.（不使用额外的空间是指不能使用字符串，整形数组是否可以呢？）

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.

两种思路：一是判断反转后是否相等，二是判断整数首尾是否相等。

反转时可能出现的问题：超出integer最大值 即： 2^32-1。

采用判断首尾是否相等的代码。

public class Solution {
    public boolean isPalindrome(int x) {
        if(x<0){
            return false;
        }
        int len=1;
        while(x/len>=10){
            len*=10; //得到长度
        }
        int l=0;
        int r=0;
        while(x!=0){
            l=x/len;//最高位
            r=x%10;//最低位
            if(l!=r){
                 return false;
                 }
            x=(x%len)/10;//去掉最高位和最低位
            len/=100;
        }
       return true;
    }
}

反转后判断

public class Solution {
    public boolean isPalindrome(int x) {
        if(x < 0) return false;
        if(x < 10) return true;
        if(x % 10 == 0) return false;
        int rev = 0;
        while(x > rev){
            rev = rev * 10 + x % 10;
            x /= 10;
        }
        return x == rev || x == rev/10;
    }
}

更多算法知识点 关注FunctionY csdn博客