03 算法之递归-数组求和-python实现

#!python
#coding=utf-8

"""
递归计算数组之和
"""
def sum_recursion(arr):
    if len(arr) == 0:
        return 0
    inx = 0
    sum = arr.pop(inx)
    if len(arr) == 0:
        return sum
    else:
        return sum + sum_recursion(arr)

print(sum_recursion([1,2,3,4,5,6,7,8,9,10]))
print(sum_recursion([1]))
print(sum_recursion([]))

运行结果

55
1
0