1.用递归求阶乘
运行结果
内存图(尝试)
2.汉诺塔问题
代码如图
import java.util.*;
public class JVMt
{
public static void main (String[] args){
Scanner in = new Scanner(System.in);
int n = in.nextInt();
hanot(n , "a" , "b" , "c");
}
static void hanot(int n , String a , String b , String c){
if(n==1){
move(a,c);
}
else{
hanot(n-1 , a , c , b);
move(a , c);
hanot(n-1 , b , a , c);
}
}
static void move (String a , String b){
System.out.printf("%s---->%s%n", a , b);//%n是与平台有关的行分隔符
}
}
运行结果如下