[leetcode] 9. Palindrome

 

 

import math 

class Solution:
    def isPalindrome(self, x: int) -> bool: 
        s = str(x) 
        l = len(s) 
        for i in range(l // 2): 
            if s[i] != s[l - 1 - i]:  
                return False 
        
        return True 

    # def isPalindrome(self, x: int) -> bool:
    #     s = str(x)
    #     l = len(s)
    #     if l == 2:
    #         return s[0] == s[1]

    #     is_even = l % 2 == 0 
    #     start = 0
    #     end = l - 1  
    #     if is_even:
    #         while start < end: 
    #             if s[start] == s[end]:
    #                 start += 1 
    #                 end -= 1 
    #             else:
    #                 return False 
    #     else: 
    #         middle_idx = math.ceil(l / 2)   
    #         for i in range(middle_idx): 
    #             if s[start] == s[end]: 
    #                 start += 1 
    #                 end -= 1 
    #             else: 
    #                 return False 
     
    #     return True