1.需求
一个楼梯有n级,每次走1级或两级,请问从1级台阶走到第n级台阶一共有多少种走法
2.代码运行结果:
3. 代码:
public static void main(String[] args) {
//一共有n级楼梯
int n;
//键盘输入楼梯的级数
System.out.println("请输入楼梯的级数:");
Scanner scanner = new Scanner(System.in);
n = scanner.nextInt();
//递归求走法种数
int sum = allWays(n);
System.out.println("一共有 " + sum + "种走法");
}
private static int allWays(int n) {
int sum = 0;
if (n == 1 || n == 2){
sum = n;
} else {
sum = allWays(n-1) + allWays(n-2);
}
return sum;
}