Lintcode斐波纳契数列
}
public class Solution {
public int fibonacci(int n) {
if(n==1||n==2){
return n-1;
}
else{int a[]=new int[n];
a[0]=0;
a[1]=1;
for(int i=2;i<n;i++){
a[i]=a[i-1]+a[i-2];
}
return a[n-1];
}}