LeetCode 143 Palindrome Number

最新推荐文章于 2020-08-18 15:23:01 发布

JavyZheng

最新推荐文章于 2020-08-18 15:23:01 发布

阅读量657

点赞数

分类专栏： LeetCode 文章标签： LeetCode Palindrome Number

本文链接：https://blog.csdn.net/javyzheng/article/details/40681377

版权

LeetCode 专栏收录该内容

151 篇文章 0 订阅

订阅专栏

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.

分析：

通过除10和取余，可以计算一个逆序的数，比较这两个数是否相等就可以了。

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