這個是leetcode中判斷是否爲迴文的python代碼,我的主要想法是每一次比較首位和末尾的數字是否相同,然後丟棄兩位再進行判斷
a = input() a = int(a) if a < 0: print(False) else: b = a i = 0 while b: i = i + 1 b = b // 10 length = i b = a sign = 0 while length > 1: if b // pow(10,length - 1) == b % 10: b = b % pow(10,length-1) b= b // 10 length = length - 2 else: sign = 1 break if sign == 0: print(True) else: print(False)