supreme000的博客

package datastructure.chapter01;import java.util.Arrays;public class Find_k_biggest_number { public static void main(String args[]) { int len=1000000; int k=7; int a[]=new int[len]; ...

代码如下：public class Fibonacci { //递归 public static long f_recursion(int n){ return n<=1? 1 : f_recursion(n-2)+f_recursion(n-1); } //非递归 public static long f(int n)...