9. Palindrome Number

最新推荐文章于 2022-02-02 16:01:08 发布

逗逗军001

最新推荐文章于 2022-02-02 16:01:08 发布

阅读量157

点赞数

分类专栏：每天一Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/u010956473/article/details/75363620

版权

每天一Leetcode 专栏收录该内容

24 篇文章 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) {
        if (x < 0)
            return false;
        if(x>=0&&x<=9)
            return true;
        else
        {

            long result = 0;
                        long x1=x;
            while (x >0)
            {

                result = result * 10+x%10;
                x = x/10;

            }
            if (result == x1)
                return true;
            else
                return false;

        }


    }
};