简单递归

// 递归的精髓就是f(n)依赖于f(n-1)


//简单递归
#include<stdio.h>
#include<stdlib.h>

void run(int num)
{
	if (num)
	{
		system("echo Go go go");
		run(num - 1);
	}
	else
		return;

}

void gotoo(int num)
{
start:	if (num)
		{
			system("echo goto goto");
			num--;
			goto start;
		}
}

//累加
int addall(int num)
{
	if (num == 1)
	{
		return 1;
	}
	else
	{
		return num + addall(num - 1);
	}
}

void main2()
{
	int number = 4;
	//run(number);
	//gotoo(number);

	printf("累加和为%d\n", addall(number));

	system("pause");
}

int tencent(int num)
{
	if (num == 1)
	{
		return 1;
	}
	else if (num == 2)
	{
		return 2;
	}
	else
	{
		return tencent(num - 1) + tencent(num - 2);
	}
}

void main()
{
	int number;
	scanf_s("%d", &number);

	printf("有%d种上台阶的方法\n", tencent(number));

	system("pause");
}