leetcode题解||Palindrome Number问题

problem:

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.


thinking:


(1)之前求过int型逆序反转。这里检验一个数是否为一个回文数,能够得到一点启示。

(2)逆序反转主要涉及溢出问题的处理,并且反转的空间复杂度能够忽略不计,满足题目要求。

code:

class Solution {
public:
    bool isPalindrome(int x) {
        int b=0;
        int a=x;
        bool flag=true;
        if(a<0)
        {
            bool flag=false;
            a=-x;
        }
        while(a)
        {
            b*=10;
            b+=a%10;
            a=a/10;
        }
        if(b>2147483647)
            return false;
        if(!flag)
            b=-b;
        return (b==x);
           
        
    }
};


转载于:https://www.cnblogs.com/wzzkaifa/p/6942059.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值