leetcode-2. Palindrome judgment

Give you an integer x , If x Is a palindrome integer , return true ; otherwise , return false .

Palindrome number 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 .

My original idea of this question is based on java Of , Turn a string into an array , Then cut it in half and compare it before and after , use python It's really troublesome to write . Look at the ideas given in the solution

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

take int To str, Flip the string by slicing , Then compare with the original string . It's a very simple way .
# Method 2 reversed function

#print("".join(reversed(a))==a)
#print(''.join(reversed(a))) reversed(a) What you get is a list  join List get string 
#. join()：  Connection string array . The string 、 Tuples 、 Elements in the list with the specified characters ( Separator ) The connection generates a new string 

Use reversed function , Flip the string , And then through join Method , Convert the list to a string , Another comparison .