# -*- coding: utf-8 -*-
# 力扣官解
def is_palindrome(n):
if n < 0 or n % 10 == 0:
return False
revert_number = 0
while n > revert_number:
revert_number = revert_number * 10 + n % 10
n = int(n / 10)
return n == revert_number or n == int(revert_number / 10)
XHS_12302