leetcode 9. Palindrome Number

判断一个数是否为回文数，直接循环判断

class Solution(object):
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        s = str(x)
        lenS = len(s)
        
        for i in range(0,lenS // 2):
             if (s[i] != s[lenS - 1 - i]): return False
        return True