class1.cs

来自「hanio算法,hanoi塔的递归程序」· CS 代码 · 共 28 行

using System;
public class Hanoi
{
	static void Move(char getone,char putone)
	{
		Console.WriteLine(getone+"->"+putone);
	}
	static void PlayHanoi(int n,char one,char two,char three)
	{
		if(n==1) Move(one,three);
		else
		{
			PlayHanoi(n-1,one,three,two);
			Move(one,three);
			PlayHanoi(n-1,two,one,three);
		}
	}
	public static void Main()
	{
		int m;
		Console.WriteLine("请输入hanoi盘的数量:");
		m=Convert.ToInt32(Console.ReadLine());
		Console.WriteLine (m+"个hanoi盘移动步骤如下");
		PlayHanoi(m,'A','B','C');
	}
}