Palindrome Number

最新推荐文章于 2024-10-27 22:09:20 发布

原创最新推荐文章于 2024-10-27 22:09:20 发布 · 514 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode

LeetCode 专栏收录该内容

67 篇文章

订阅专栏

本文介绍了一种不使用额外空间判断整数是否为回文数的方法。通过算法直接比较整数的首位数字来实现，避免了字符串转换带来的空间开销，并提供了一个C++示例实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

找到base，x除base是左数，x%10是右树

class Solution {
public:
    bool isPalindrome(int x) {
        if(x<0) return false;
        int base=1;
        while(x/base>=10) base*=10;
        while(x){
            if(x/base==x%10){
                x=(x-(x/base)*base)/10;
                base/=100;
            }
            else return false;
        }
        return true;
    }
};