Palindrome Number(算法分析week6)

Palindrome Number

题目来源：https://leetcode.com/problemset/algorithms/

-问题描述-
-解题思路-
-代码实现-

问题描述

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.

解题思路

计算反转后的数字，比较反转后数字与原数字大小，如果相等，那么这个数是一个回文数，否则这个数不是回文数。
注意：如果数字为负数，那么这个数不是回文数。

代码实现

@requires_authorization
class Solution {
public:
    bool isPalindrome(int x) {
        long long int sum = 0;
        int x1 = x;
        if (x < 0) 
            return false;
        while (x != 0) {
            int r = x%10;
            x = x/10;
            sum = sum*10 + r;
        }
        if (sum == x1) return true;
        else return false;
    }
};