Leetcode Easy 3 Palindrome Number

1.

class Solution:
    def isPalindrome(self, x):
        s = str(x)
        s_ = s[::-1]
        if s == s_:
            return True
        else:
            return False

2.

class Solution:
    def isPalindrome(self, x):
        s = str(x)
        len_s = len(s)
        i, j = 0, len_s-1
        while i < j:
            if s[i] == s[j]:
                i += 1
                j -= 1
            else:
                return False
        return True