# 遞推法
def sum01(n):
result = 0
for i in range(1, n+1):
result += i
return result
# 遞歸法
def sum02(n):
if n == 1:
return 1
else:
return n + sum02(n-1)
# 數學公式法
def sum03(n):
return n * (1 + n) / 2
# 遞推法
def sum01(n):
result = 0
for i in range(1, n+1):
result += i
return result
# 遞歸法
def sum02(n):
if n == 1:
return 1
else:
return n + sum02(n-1)
# 數學公式法
def sum03(n):
return n * (1 + n) / 2