递归(上)MOOC学习笔记

Recursion(上) 1. 数列求和 def sumlist(mylist): if len(mylist) == 1: return mylist.pop() else: return mylist[0] + sumlist(mylist[1:]) pass print(sumlist([1,2,3,4,1,6,8])) 2. 进制换算 def toStr(num,base): coverstring = "0123456789ABCDEF" if num < base: return cov