线性表:
堆栈:
栈的特点:
用递归实现累加和:
#1~10的累加和==10+(1~9的累加和)
# result = 1+2+3+4+5+6+7+8+9+10
def s(n):
if n==1:
return 1
result = n+s(n-1)
return result
if __name__ == '__main__':
result = s(1000)
print('1~10的累加和:',result)
# a = 12#4个字节---4B
#
# 1024B = 1KB
# 1024KB= 1MB