LeetCode题目：Palindrome Number

最新推荐文章于 2021-02-14 16:18:24 发布

原创最新推荐文章于 2021-02-14 16:18:24 发布 · 194 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #算法 #设计

算法应用作业专栏收录该内容

34 篇文章

订阅专栏

本文介绍了一种不使用额外空间判断整数是否为回文数的方法，并提供了一个C++实现示例。讨论了负数作为回文数的可能性及反转整数时可能遇到的溢出问题。

题目地址：点击打开链接

题目描述：

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 tep=0,y=x;
        while(x){
            tep=tep*10+x%10;
            x=x/10;
        }
        if(tep==y&&y>=0)return 1;//不明白为什么负数不行
        else return 0;
    }
};