![](https://i-blog.csdnimg.cn/blog_migrate/b3fa2978d0bcd470ab320f27bdd038c5.png)
分析:
- 递归将由简单到复杂
- 如果次数明确的情况下选择迭代方法
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sca = new Scanner(System.in);
int n = sca.nextInt();
System.out.println(ToGo(n));
}
private static int ToGo(int n) {
if(n == 1) {
return 1;
}
if(n == 2) {
return 2;
}
if(n == 3) {
return 4;
}
return ToGo(n - 1) + ToGo(n - 2) + ToGo(n - 3);
}
}
运行结果:
34
615693474