用java生成汉诺塔问题代码
时间: 2024-02-03 16:15:20 浏览: 24
下面是使用Java递归生成汉诺塔问题的代码:
```java
public class HanoiTower {
public static void main(String[] args) {
int n = 3; // 汉诺塔层数
hanoi(n, 'A', 'B', 'C');
}
public static void hanoi(int n, char a, char b, char c) {
if (n == 1) {
System.out.println("Move disk " + n + " from " + a + " to " + c);
} else {
hanoi(n - 1, a, c, b);
System.out.println("Move disk " + n + " from " + a + " to " + c);
hanoi(n - 1, b, a, c);
}
}
}
```
输出结果为:
```
Move disk 1 from A to C
Move disk 2 from A to B
Move disk 1 from C to B
Move disk 3 from A to C
Move disk 1 from B to A
Move disk 2 from B to C
Move disk 1 from A to C
```