[算法题]输出斐波那契数列的第N项

public int Fibonacci(int n) {
int[] result = {0,1};
if(n < 2){
return result
;
}

int res = 0,numPre=0, numNext=1;
for (int i=2;i<=n;i++){
res = numPre + numNext;
numPre = numNext;
numNext = res;
System.out.println("round " + i + ", res:" + res);
}

System.out.println("Fibonacci " + n + " result:" + res);
return res;
}