📄 递归调用函数.txt
字号:
//hanio塔问题
void move(int a,int b,int c,int level)
{ //从a移到c
if(level==1)
{
output "move from ",a," to ",c,"\n";
return;
}
move(a,c,b,level-1);
output "move from ",a," to ",c,"\n";
move(b,a,c,level-1);
}
void main()
{
output "请输入hanio塔的层数:";
int i;
input i;
while(i<=0 || i>10)
{
if(i<=0)output "请输入hanio塔的层数!";
else output "数字太大!请输入hanio塔的层数:";
input i;
}
move(1,2,3,i);
output "Success!\n";
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -