/*************************************************
题目:9. 求1+2+3+……+n的和
不能用乘除法、for while if switch等
思路:还是让相同的代码循环执行n遍
1.构造函数
先定义一个类型,然后创建n个实例,构造函数中++n
2.使用虚函数求解
!!n,n为0时为0,不为0时为1,可以分两种情况调用虚函数
3.使用函数指针
也是根据!!n选择调用哪个函数
****************************************************/
//解法一:构造函数
class Temp{
public:
Temp(){++N;sum+=N;}
static void reset(){N=0;sum = 0;}
static unsigned int GetSum(){return sum;}
private:
static int N;
static 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();
}
//解法二:虚函数
class A{
public:
virtual unsigned int sum(unsigned int n)
{
return 0;
}
};
A* array[2];
class B:public A
{
public:
virtual unsigned int sum(unsigned int n)
{
return array[!!n]->sum(n-1)+n;
}
};
int sum_solution2(unsigned 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 solution_3_tem(unsigned int n)
{
return 0;
}
unsigned int solution_3(unsigned int n)
{
static fun f[2]={solution_3_tem,solution_3};
return n+f[!!n](n-1);//调用哪个函数啦
}
求1+2+3+……+n的和
最新推荐文章于 2021-07-27 17:48:09 发布