个人博客导航页(点击右侧链接即可打开个人博客):大牛带你入门技术栈
动态规划篇
- 从斐波那契数列开始
我们先给出斐波那契数列的常用算法类
public class Fibonacci { private static int num = 0; private Fibonacci() { } public static int fib(int n) { num++; if (n == 0) { return 0; } if (n == 1) { return 1; } return fib(n - 1) + fib(n - 2); } public static void main(String[] args) { num = 0; int n = 20; long start = System.nanoTime(); int res = Fibonacci.fib(n); long end = System.nanoTime(); System.out.println(res); System.out.println((end -