青蛙跳台阶递归和非递归实现

/////////////////////////////////////非递归
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int JumpFloor(int n)
{
int j1 = 1;
int j2 = 2;
int j3 = 0;
int i = 0;
if (n == 1 || n == 2)
{
return n;
}
for (i = 3; i <= n; i++)
{
j3 = j1 + j2;
j1 = j2;
j2 = j3;
}
return j3;
}
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int main()
{
JumpFloor(5);
printf("%d\n", JumpFloor(5));
return 0;
}
////////////////////////////////////递归
int JumpFloor(int n)
{
if (n == 1||n==2)
{
return n;
}
if (n>2)
{
return JumpFloor(n - 1) + JumpFloor(n - 2);
}
}
int main()
{
JumpFloor(5);
printf("%d\n", JumpFloor(5));
return 0;
}