问题:求1+2+3+…+n,要求不能使用乘除法,for,while,if,else,switch,case,等关键字及条件判断语句。
解决思路:一般思路就是循环,递归,或者公式n(1+n)/2
方法一:利用构造函数求解
思路:可以让构造函数重复执行++操作
class Temp
{
public:
Temp()
{
N++;
Sum += N;
}
static void Reset()
{
N = 0;
Sum = 0;
}
static unsigned int GetSum()
{
return Sum;
}
static unsigned int N;
static unsigned int Sum;
};
unsigned int Temp::N = 0;
unsigned int Temp::Sum = 0;
unsigned int Sum_Solution1(unsigned int n)
{
Temp::Reset();
Temp *a = new Temp[n];
delete []a;
a = NULL;
return Temp::GetSum();
}
方法二:利用虚函数求解,递归
思路:利用虚函数的特性:动态绑定,实现递归,实现二选一的话,可以用布尔变量,!!n 可以将非0转为true,0转为false。
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;
}
};
int Sum_Solution2(int n)
{
A a;
B b;
Array[0] = &a;
Array[1] = &b;
int sum = Array[1]->Sum(n);
return sum;
}
方法三:利用函数指针求解,递归
和虚函数类似的思路
typedef unsigned int(*fun)(unsigned int n);
unsigned int Solution3_Tem(unsigned int n)
{
return 0;
}
unsigned int Sum_Solution3(unsigned int n)
{
static fun f[2] = { Solution3_Tem, Sum_Solution3 };
return n + f[!!n](n - 1);
}
方法四:利用函数模板
template <unsigned int n> struct Sum_Solution4
{
enum Value{ N = Sum_Solution4<n - 1>::N + n };
};
template<> struct Sum_Solution4<1>
{
enum Value { N = 1 };
};
void TestSum4()
{
cout << Sum_Solution4<3>::N << endl;
}