C_递归实现汉诺塔及青蛙问题

 汉诺塔问题

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
void move(char X, char Y)
{
	printf("%c->%c\n", X, Y);
}
void Hanota(int n, char one, char  two, char  three)
{
	if (n == 1)
		move(one, three);
	else
	{
	    Hanota(n - 1, one, three, two);
	    move(one,three);
	    Hanota(n - 1, two, one, three);
	}
}
int main()
{
	int n = 0;
	printf("输入盘子个数:\n");
	scanf("%d", &n);
	Hanota(n, 'A', ' B',' C');
	system("pause");
	return 0;
}

青蛙跳台阶问题

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
/*当青蛙一次可以跳一级或者两级时，
n=1，fac1(1)=1;
n=2,fac1(2)=2;
n=3,fac1(3)=3;
n=4,fac1(4)=5;
……
fac1(n)=fac1(n-1)+fac1(n-2)
*/
int fac1(int n)
{
	if (n == 1)
		return 1;
	else if (n == 2)
		return 2;
	else
	{
		return fac1(n - 1) + fac1(n - 2);
	}
}
/*
当青蛙一次可以跳一级，二级或三级时，
n=1，fac2(1)=1;
n=2,fac2(2)=2;
n=3,fac2(3)=4;
n=4,fac2(4)=8;
……
fac2(n)=fac2(n-1)+fac2(n-2)+fac(n-3)+1;
*/
int fac2(int n)
{
	if (n == 1)
		return 1;
	else if (n == 2)
		return 2;
	else if (n == 3)
		return 4;
	else
	{
		return fac2(n - 1) + fac2(n - 2) + fac2(n - 3) + 1;
	}
}
int main()
{
	int n = 0;
	printf("请输入台阶数：\n");
	scanf("%d", &n);
	int i = fac1(n);
	int j = fac2(n);
	printf("%d\n", i);
	printf("%d\n", j);
	system("pause");
	return 0;
}