# 循环方式
def sum_cycle(n):
sum = 0
for i in range(1,n+1) :
sum += i print(sum)
# 递归方式
def sum_recu(n):
if n>0:
return n +sum_recu(n-1)
else:
return 0
sum_cycle(100)
sum = sum_recu(100) print(sum)
供你参考哦,代码如下:
# 递归求和:n等于0时终止,并返回0
def sum_recu(n):
if n == 0:
return 0
else:
return n + sum_recu(n - 1)
if __name__ == '__main__':
sum = sum_recu(5)
print(sum)
如上,当n=5的时候,执行结果等于15。