题解 | #斐波那契数列# 非递归
斐波那契数列
http://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
public int Fibonacci(int n) {
int[] flag = new int[41];
flag[0] = 0;
flag[1] = 1;
for(int i = 2; i<=n;i++){
flag[i] = flag[i-1]+flag[i-2];
}
return flag[n];
}
}
