LeetCode题解：9. Palindrome Number

class Solution {
public:
    bool isPalindrome(int x) {
        int a = 0, b = x;
        while(b > 0) {
            a = a * 10 + b % 10;
            b /= 10;
        }
        if(a == x)
            return true;
        else
            return false;
    }
};

class Solution {
public:
    bool isPalindrome(int x) {
        if (x < 0)
        {
            return false;
        }
        else if (x < 10)
        {
            return true;
        }

        int o = x;
        long long result = 0;
        while (x)
        {
            result = 10 * result + x % 10;
            x = x / 10;
        }
        return result > INT_MAX ? false : result == o;
    }
};

static const auto _____ = []() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    return nullptr;
}();