题目
求1+2+3+…+n,要求不能使用乘除法、for、while、if、else、switch、case等关键字及条件判断语句(A?B:C)。
方法一:采用递归,利用逻辑与的短路特性
具体什么是短路特性 ,可以参考这位博主的博客链接如下:
https://blog.csdn.net/xiaoquantouer/article/details/71023448
代码
class Solution {
public:
int Sum_Solution(int n) {
int ans=n;
ans&&(ans+=Sum_Solution(n-1));
return ans;
}
};
方法二:利用构造函数求解
#include "stdafx.h"
#include<iostream>
using namespace std;
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_Solution1(unsigned int n)
{
Temp::Reset();
Temp*a = new Temp[n];
delete[]a;
a = nullptr;
return Temp::GetSum();
}
int main()
{
int K=Sum_Solution1(100);
cout << K << endl;
return 0;
}