汉诺塔迭代算法的实现及移动顺序打印

//n盘子个数&＃xff0c;src原地&＃xff0c;temp中转地&＃xff0c;dst目的地
void HNT(int n, char src, char temp, char dst)
{if(n<1)return;HNT(n - 1, src, dst,temp); //迭代的将n-1个盘子从原地&＃xff0c;以dst为中转&＃xff0c;搬到tempprintf("%c-->%c ", src, dst); //打印移动顺序HNT(n-1,temp, src, dst); //迭代将n-1个盘子&＃xff0c;从temp&＃xff0c;以src为中转&＃xff0c;搬到dst
}
int main()
{HNT(3, &＃39;A&＃39;, &＃39;B&＃39;, &＃39;C&＃39;);
}