【数据结构】【递归】一.数组求和，任意进制转换

 

def listsum(numList):
    if len(numList) == 1:
        return numList[0]
    else:
        return numList[0] + listsum(numList[1:])  # 调用自身


print(listsum([1,3,5,7,9]))

更小规模！ 调用自身！

任意进制转换

def toStr(n,base):
    convertString = '0123456789ABCDEF'
    if n < base:  # 最小规模
        return convertString[n]
    else:
        # 减小规模，调用自身
        return toStr(n//base,base) + convertString[n%base]

print(toStr(1453,16))