class Solution:
def isPalindrome(self, x: int) -> bool:
number = str(x)
i = 0
rnumber = number[::-1]
while i < len(number):
if number[i] != rnumber[i]:
return False
i+=1
return True
LeetCode:009.回文数
猜你喜欢
转载自blog.csdn.net/dosdiosas_/article/details/105730514
今日推荐
周排行