![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
练习题
新一代搬砖农民工
这个作者很懒,什么都没留下…
展开
-
斐波那契数列的数组法和递归法
斐波那契数列的数组法和递归法 数组法: public static int Fibonacci(int n) { int[] f = new int[n+1]; f[1] = f[2] = 1; for (int i = 3; i <= n; i++) { f[i] = f[i-1] + f[i-2]; } return f[n]; }...原创 2019-12-04 14:45:51 · 720 阅读 · 0 评论 -
复习题
What will happen when you attempt to compile and run the following code? public class Test{ static{ int x=5; } static int x,y; public static void main(String args[]){ x--; myMethod( ); Sys...原创 2019-04-23 10:44:57 · 160 阅读 · 0 评论