9. Palindrome Number

题目

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Example 1:

Input: 121
Output: true

Example 2:

Input: -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.

Example 3:

Input: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Follow up:

Coud you solve it without converting the integer to a string?

解法：
不转为字符串，逐次取余，倒转存储到另一个数，最后比较，回文数两值一样。

代码如下：

bool isPalindrome(int x) {
    if (x < 0) return false;
    if (x < 10) return true;
    int cVal = 0;
    int oriVal = x;
    int max = INT_MAX / 10;
    while (x > 0) {
        if (cVal > max || (cVal == max && x % 10 > 7)) return false;
        cVal = cVal * 10 + x % 10;
        x /= 10;
    }
    return (cVal == oriVal);
}