Discuss / Python / 顺便复习了下递归,写的较麻烦。没上面的大神写的简单

顺便复习了下递归,写的较麻烦。没上面的大神写的简单

Topic source

Mc_小枫

#1 Created at ... [Delete] [Delete and Lock User]

def is_palindrome(n): number = str(n) if len(number) == 1 or None: return True elif number[0] == number[-1]: print('%s = %s'%(number[0],number[-1])) return is_palindrome(number[1:-1]) else: return False print (list(filter(is_palindrome,list1))


  • 1

Reply