大家都知道斐波那契数列,现在要求输入一个整数n,请你输出斐波那契数列的第n项。
n<=39.
public class Solution {
public int Fibonacci(int n) {
if(n<=1){
return n;
}
int[] record = new int[n+1];
record[0] = 0;
record[1] = 1;
for(int i=2;i<=n;i++){
record[i] = record[i-1] + record[i-2];
}
return record[n];
}
}