题解 | #斐波那契数列#
斐波那契数列
http://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
public class Solution {
public int Fibonacci(int n) {
int a = 1 ,b = 1;
int ans = 0;
ans = a + b;
b = a;
a = ans;
}
return ans;
}
}
public int Fibonacci(int n) {
int a = 1 ,b = 1;
int ans = 0;
if(n < 3) return 1;
//只与前两个值有关
for(int i = 3;i<=n;i++){ans = a + b;
b = a;
a = ans;
}
return ans;
}
}