剑指47-求1+2+3+...+n

class Solution {
public:
    int Sum_Solution(int n) {
        //if(n==1) return n;
        //return n+Sum_Solution(n-1);

        bool x=n>1 && (n+=Sum_Solution(n-1));
        return n;
    }
};