1.递归函数：
public class Main {
public int f(int n){
if (n == 0 | n==1) return 1;
else
return (f(n-1)+f(n-2));
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
scanner.close();
Main main = new Main();
System.out.print( main.f(n) );
}
}
运行约1.4s...
方法2：普通int数组
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
scanner.close();
int [] sum = new int[8];
sum[0]=1;
sum[1]=1;
for (int index =2; index list = new ArrayList(8);
list.add(0,1);
list.add(1,1);
for (int val = 2;val iterator = list.iterator();
while (iterator.hasNext()){
System.out.print( iterator.next()+" ");
}
｝
运行约1.5s
