【LeetCode】9 Palindrome Number 回文数判定

最新推荐文章于 2024-09-16 01:56:04 发布

weixin_33916256

最新推荐文章于 2024-09-16 01:56:04 发布

阅读量72

点赞数

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/zhstudy/p/6009244.html

版权

题目：

　　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?

思路：这题比较简单，可以把数字翻转与原数进行比对。需要注意的是负数的判定以及翻转之后可能会产生溢出的问题。

public class Solution {
    public boolean isPalindrome(int x) {
        if(x<0) return false;
        long res=0;
        long lx=x;
        while(lx!=0){
            res=res*10+lx%10;
            lx/=10;
        }
       return res==x;
    }
}

---恢复内容结束---

转载于:https://www.cnblogs.com/zhstudy/p/6009244.html