LeetCode 9. Palindrome Number

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.

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

class Solution {

public:

bool isPalindrome(int x) {

if(x < 0)

return false;

int len = 1;

while(x / len >= 10) {

len = len * 10;

}

while(x) {

int left = x / len;

int right = x % 10;

if(left != right) {

return false;

}

x = x % len;

x = x / 10;

len = len / 100;

}

return true;

}

};

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版