题目
思路
把走n层台阶抽象成函数f(n)
于是会有
f
(
0
)
=
1
f
(
1
)
=
1
f
(
2
)
=
2
f
(
3
)
=
4
f(0)=1\quad f(1) = 1\quad f(2) = 2\quad f(3) = 4\quad
f(0)=1f(1)=1f(2)=2f(3)=4
f
(
n
)
=
f
(
n
−
1
)
+
f
(
n
−
2
)
+
f
(
n
−
3
)
+
f
(
n
−
4
)
n
≥
4
f(n) =f(n-1)+f(n-2)+f(n-3)+f(n-4) \quad n≥4
f(n)=f(n−1)+f(n−2)+f(n−3)+f(n−4)n≥4
代码(递归)
long long re_func(long long a)
{
if(a == 0)
{
return 1;
}
if(a == 1)
{
return 1;
}
if(a == 2)
{
return 2;
}
if(a == 3)
{
return 4;
}
return (re_func(a - 1) + re_func(a - 2) + re_func(a - 3) + re_func(a - 4));
}
代码(迭代)
但是迭代的话会重复计算比n小的情况,最终有可能会出现4^n的进程导致栈溢出,所以其实迭代可以更高效更省时间
#include<iostream>
using namespace std;
long long it_func(long long a)
{
long long arr[100];
arr[0] = 1;
arr[1] = 1;
arr[2] = 2;
arr[3] = 4;
for(int i = 4; i < 100; i++)
{
arr[i] = arr[i - 1] + arr[i - 2] + arr[i - 3] + arr[i - 4];
}
return arr[a];
}
int main()
{
int t;
cin >> t;
for(int i = 0; i < t; i++)
{
cout << "case #" << i << ":"<<endl;
long long a;
cin >> a;
cout << it_func(a) << endl;
}
return 0;
}