斐波那契函数

import java.util.List;
import java.util.LinkedList;
import java.util.Scanner;
public class Demo{
public static void main(String args[]){
Scanner sc = new Scanner(System.in) ;
int n = sc.nextInt() ;
fibn(n) ;
}

public static void fibn(int n){ //产生长度为n的斐波那契数列
List<Integer> list = new LinkedList<Integer>();
int a = 0;
int b = 1;
list.add(a);
list.add(b);
while(list.size()<=n-1){
int tmp = b;
b = a+b;
a =tmp;
list.add(b);
}

for(Integer i:list)
System.out.print(i+",");
}
}