首页 > 其他 > 详细

【Leetcode】Palindrome Number

时间:2014-03-28 17:40:08      阅读:474      评论:0      收藏: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.

解题思路:将整数翻转,然后比较是否与原数相等即可,注意负数肯定不是回文,另外需要注意对溢出的处理。

代码:

class Solution {
public:
    bool isPalindrome(int x) {
        int result=0;
        if(x<0)return false;
        int tmp=x;
        while(x!=0){
            if(result>INT_MAX/10)return false;
            result=result*10+x%10;
            x/=10;
        }
        return result==tmp;
    }
};


【Leetcode】Palindrome Number,布布扣,bubuko.com

【Leetcode】Palindrome Number

原文:http://blog.csdn.net/ussam/article/details/22314791

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!