算法第三周Palindrome Number[easy]

Palindrome Number[easy]

---

Description

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.

---

Analysis

Palindrome Number ：回文数，若将n的各位数字反向排列所得自然数n1与n相等，则称n为一回文数。
首先我们要清楚，负数不是回文数；剩下的工作就是判断逆序的数字与原数字是否相等（即上一道题”Reverse Integer”);同样此题仍需注意溢出问题。

---

Solution

class Solution {
public:
    bool isPalindrome(int x) {
        if (x < 0) return false;
        int r = x;
        int temp = 0;
        int result = 0;
        while (x != 0) {
            int m = x%10;
            temp = result*10 + m;
            if ((temp-m)/10 != result) {
                return false;
            }
            result = temp;
            x = x/10;
        }
        if (result == r) return true;
        else return false;
    }
};