题解 | #斐波那契数列#
斐波那契数列
https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
public class Solution { public int Fibonacci(int n) { if(n<=1){ return n; } int a = 0; int b = 1; int res = 0; for(int i=2; i<=n; i++){ res = a + b; a = b; b = res; } return res; } }