LeetCode 9: Palindrome Number

LeetCode Math

Determine whether an integer is a palindrome. Do this without extra space.

代码

bool isPalindrome(int x) {
    if (x < 0 || (x!=0 && x%10==0)) {
        return false;
    }
    int sum = 0;
    while (x > sum) {
        sum = sum*10 + x%10;
        x /= 10;
    }
    return (x==sum)||(x==sum/10);
    
}