【leetcode】Palindrome Number

整数回文判断

最新推荐文章于 2020-08-18 15:23:01 发布

原创最新推荐文章于 2020-08-18 15:23:01 发布 · 6.4k 阅读

0 ·

CC 4.0 BY-SA版权

Algorithm 专栏收录该内容

87 篇文章

订阅专栏

本文提供了两种使用C++实现的方法来判断一个整数是否为回文数，且不使用额外的空间。第一种方法通过比较最高位和最低位来逐步验证，而第二种方法则递归地检查数字的对称性。

Question：

Determine whether an integer is a palindrome. Do this without extra space.

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.

Anwser 1：

class Solution {
public:
    bool isPalindrome(int x) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(x < 0) return false;
        
        int div = 1;
        while(x/10 >= div){     // get large division
            div *= 10;
        }
        
        while(x > 9){
            int high = x / div;     // left digit
            int low = x % 10;       // right digit
            
            if(high != low){
                return false;
            }
            
            x = (x % div) / 10;     // get number between first and last
            div /= 100;
        }
        
        return true;
    }
};

Anwser 2：

class Solution {
public:
    bool check(int x, int &y) {
        if (x == 0) return true;
    
        if (check(x/10, y) && (x%10 == y%10)) {
            y /= 10;
            return true;
        } else {
            return false;
        }
    }

    bool isPalindrome(int x) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(x < 0) return false;
        
        return check(x, x);
    }
};

参考推荐：

Palindrome Number