1.math.pow
class Solution {
public:
int Sum_Solution(int n) {
return ((int)pow(n,2)+n)>>1;
}
};
2.递归. &短路
class Solution {
public:
int Sum_Solution(int n) {
int sum=n;
bool res = sum && (sum += Sum_Solution(--n));
return sum;
}
};