用java写一个函数，实现Fibonacci数列算法(1,1,2,3,5,8,13......)

这个算法就是第一个数的救国是前两个数相加

public class dd1 {

public void getFibonacci(int number){
int nLeft = 0;
int nRight = 1;
System.out.print(nRight);
for (int i = 0; i < number; i++) {
int sum = nLeft + nRight;
System.out.print(" " + sum);
nLeft = nRight;
nRight = sum;
}
}
public static void main(String[] args) {
new dd1().getFibonacci(20);
}
}