LeetCodeOJ. Palindrome Number

试题请参见: https://oj.leetcode.com/problems/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.

解题思路

正如题目中的提示所述, 我们可以把这个问题简化为: 比较一个数和这个数的"倒序"是否相等.

不过需要注意一点: 数据溢出的问题, 比如2147483647倒序为7463847412, 此时超过了INT_MAX的范围.

不过, 这是没有关系的, 因为2147447412是INT_MAX中最大的回文数了, 这个数并没有溢出, 因此, 我们可以不需要处理溢出的问题.

源代码

class Solution {
public:
    bool isPalindrome(int x) {
        return ( x >= 0 && x == reverse(x) );
    }
private:
    int reverse(int x) {
        int y = 0;

        while ( x != 0 ) {
            y = y * 10 + x % 10;
            x /= 10;
        }

        return y;
    }
};