递归

代码中包含汉诺塔解答思路

#include<stdio.h>

long recursion(int n);
void move(char x, char y);
void hanoi(int n, char one, char two, char three);


void main()
{
	输入一个数输出该数的乘方
	//int n;
	//long result;

	//printf("输入整型数字");
	//scanf_s("%d",&n);

	//result = recursion(n);
	//printf("%d !=%1d\n",n,result);

	//利用递归解决汉诺塔问题
	int m;
	printf("请输入有盘子的个数：");
	scanf_s("%d",&m);
	
	hanoi(m, 'A', 'B', 'C');


}


//递归输出乘方
long recursion(int n)
{
	long temp_res;
	if (n < 0)
		printf("n<0,输入错误\n");
	else if (n == 0 || n == 1)
		temp_res = 1;
	else
		temp_res = recursion(n - 1) * n;

	return temp_res;
}

//汉诺塔移动函数
void move(char x, char y)
{
	printf("%c-->%c\n",x,y);
}

//汉诺塔
void hanoi(int n, char one, char two, char three)
{
	void move(char x, char y);
	if (n == 1)
		move(one, three);
	else
	{
		hanoi(n - 1, one, three, two);
		move(one, three);
		hanoi(n - 1, two, one, three);
	}
}

标签：递归,2021.9,void,hanoi,three,C语言,char,int,printf
来源： https://blog.csdn.net/doctorslee/article/details/120203073