思路:
运用递归的思路,递归停止的条件是n=0,然后回溯。
要注意python中逻辑运算符的用法,a and b,a为False,返回a,a为True,就返回b
# -*- coding:utf-8 -*-
class Solution:
total=0
def Sum_Solution(self, n):
# write code here
total = n and n+self.Sum_Solution(n-1)
return total