[leetcode] number of palindromes [9]

problem :  Give you an integer x, If x Is a palindrome integer , return True; otherwise , return False

Palindrome number It refers to positive order ( From left to right ) Reverse order ( From right to left ) Read all the same integers . for example ,121 It's palindrome. , and 123 No

Example 1

Input : x = 121
Output : True 

Example 2

Input : x = -121

Output : False

explain : Read left to right , by -121, Read right to left , by 121- , So it's not a palindrome number

Example 3

Input : x = 10

Output : False

explain : Read right to left , by 01, So it's not a palindrome number

def isPalindrome(x):
    str_x = str(x)
    reverse_str_x = str_x[::-1]
    if reverse_str_x == str_x:
        return True
    else:
        return False

isPalindrome(121)
isPalindrome(10)
isPalindrome(-121)