【从零单排之微软面试100题系列】12之求1+2+3+…+n

原题参见july大神博客系列【微软面试100题】

题目描述：求1+2+3+…+n，不能使用乘除法，for、if、while、switch、case等关键字以及条件判断 A?B:C

 

分析思路：（本题亦见于《剑指offer》面试题46）

算是发散性思维的一道题，书中给出了4总解法

解法1：利用构造函数和静态数据成员。

class Temp
{
  public:
	Temp(){++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 Temp::N = 0;
unsigned int Temp::sum = 0;

unsigned int sum_solution(unsigned int n)
{
	Temp::reset();
	Temp *a = new Temp[n];
	delete []a;
	a = NULL;
	return Temp::GetSum();
}

解法2：利用虚函数

class A;
A* Array[2];
class A
{
  public:
	virtual unsigned in sum(unsigned int n)
	{
		return 0;
	}
};
class B : public A
{
  public:
	virtual unsigned in sum(unsigned int n)
	{
		return Array[!!n]->sum(n-1) + n;
	}
};

unsigned int sum_solution2(unsigned int n)
{
	A a;
	B b;
	Array[0] = &a;
	Array[1] = &b;
	unsigned int value = Array[1]->sum(n);

	return value;	
}

解法3：利用函数指针

typedef unsigned int (*fun) (unsigned int);
unsigned int solution_Terminator(unsigned int n)
{
	return 0;
}

unsigned int sum_solution3(unsigned int n)
{
	static fun f[2] = {solution_Terminator, sum_solution3};
	return n + f[!!n] (n-1);
}

解法4：利用模板类型，让编译帮助完成递归计算

template<unsigned int n> 
struct sum_soulution4
{
	enum Value{N = sum_solution4< n-1 >::N + n};
};

template< > 
struct sum_solution4<1>
{
	enum Value{N = 1};
};