Leetcode 9th

题:Number of replies Can pruning, directly judge negative numbers, 0, and numbers that can be divisible by 10 c++:

bool isPalindrome(int x) {
        if(x < 0)
            return false;
        if(x == 0)
            return true;
        if(x % 10 == 0)
            return false;
        int temp = 0;
        int num = x;
        while(x)
        {
            temp = temp * 10 + x % 10;
            x = x / 10;
        }
        return (num == temp) ? true : false;
    }

python: Solution one:

    def isPalindrome(self, x):
        str1 = str(x)
        length = len(str1)
        i = 0
        while(i <= length // 2):
            if(str1[i] != str1[length - i - 1]):
                return False
            i += 1
        return True

解法二: one line

def isPalindrome(self, x):
        return str(x) == str(x)[::-1]