64_求1+2+…+n

求1+2+…+n

求 1+2+…+n ，要求不能使用乘除法、for、while、if、else、switch、case等关键字及条件判断语句（A?B:C）。

示例 1：

输入: n = 3
输出: 6
示例 2：

输入: n = 9
输出: 45

限制：

• 1 <= n <= 10000

题解：使用C++中的静态变量，构造函数，函数指针，模板类的实例化完成累加

#include <iostream>
#include <vector>
#include <array>
using namespace std;

#define main64 main64
//===================================================使用静态变量
class sumSolution{
public:
    sumSolution(){++N;Sum += N;}
    static void Reset(){N = 0;Sum = 0;}
    static unsigned int GetSum(){return Sum;}
private:
    static unsigned int N;
    static unsigned int Sum;
};
unsigned int sumSolution::N = 0;
unsigned int sumSolution::Sum = 0;
unsigned int Sum_solution(unsigned int n){
    sumSolution::Reset();
    sumSolution* a = new sumSolution[n];
    delete[] a;
    a = nullptr;
    return sumSolution::GetSum();
}
//===================================================构造函数
class A;
A* Array[2];
class A{
public:
    virtual unsigned int sum(unsigned int n){return 0;}
};
class B:public A{
public:
    virtual unsigned int sum(unsigned int n){
        return Array[!!n]->sum(n-1) + n;    // !!n的使用
    }
};
int sumSolution2(int n){
    A a;
    B b;
    Array[0] = &a;
    Array[1] = &b;
    int value = Array[1]->sum(n);
    return value;
}
//=====================================================函数指针
typedef unsigned int (*fun)(unsigned int);
unsigned int solutionTeminator(unsigned int){
    return 0;
}
unsigned int sumSolution3(unsigned int n){
    static fun f[2] = {solutionTeminator,sumSolution3};
    return n+f[!!n](n-1);
}
//=====================================================模板类实例化
template<unsigned int n> struct sumSolution4{
    enum Value{N = sumSolution4<n-1>::N + n};
};
template <> struct sumSolution4<1>{
    enum Value{N = 1};
};

int main64(){
    cout<<Sum_solution(9)<<endl;
    cout<<sumSolution2(9)<<endl;
    cout<<sumSolution3(9)<<endl;
    cout<<sumSolution4<9>::N<<endl;
    return 0;
}