思路:
递归:退出条件n=0
思路二:等差数列公式,pow(x,y) :除2用右移
# -*- coding:utf-8 -*-
class Solution:
def Sum_Solution(self, n):
# write code here
if n==0:
return 0
return n+self.Sum_Solution(n-1)
public class Solution {
public int Sum_Solution(int n) {
if (n==0) return 0;
else return n+Sum_Solution(n-1);
}
}
思路二:(n.^2+n)/2
public class Solution {
public int Sum_Solution(int n) {
return ((int) Math.pow(n,2) + n) >> 1;
}
}