LeetCode:Palindrome Number

最新推荐文章于 2020-06-19 10:56:37 发布

walker lee

最新推荐文章于 2020-06-19 10:56:37 发布

阅读量396

点赞数

分类专栏： LeetCode OJ LeetCode解题记录文章标签： LeetCode Palindrome Number

本文链接：https://blog.csdn.net/itismelzp/article/details/50248315

版权

LeetCode OJ 同时被 2 个专栏收录

216 篇文章 0 订阅

订阅专栏

LeetCode解题记录

216 篇文章 13 订阅

订阅专栏

Palindrome Number

Total Accepted: 94491 Total Submissions: 315852 Difficulty: Easy

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.

只考虑整数的一半即可。

code:

class Solution {
public:
    bool isPalindrome(int x) {
        
        if(x<0 || (x!=0 && 0==x%10)) return false;
        int ret=0;
        while(x>ret){  // 反转x的后半部分
            ret = 10*ret + x%10;
            x/=10;
        }
        return ret == x || ret/10 == x; // 偶数、奇数情况
    }
};