ICode9

精准搜索请尝试: 精确搜索
  • 递归算法-汉诺塔2022-08-11 00:03:50

    class HanoiTower{ public static void main(String[] array){ Tower tower=new Tower(); tower.towerMove(3, 'A', 'B', 'C'); } } //num是盘的数量。a,b,c是三个塔。 class Tower{ public void towerMove(int num,ch

专注分享技术,共同学习,共同进步。侵权联系[81616952@qq.com]

Copyright (C)ICode9.com, All Rights Reserved.

ICode9版权所有