class Solution {
public int fib(int n) {
if (n<=1) {
return n;
}
int[] dp = new int[n+1];
dp[0] = 0;
dp[1] = 1;
for(int i=2; i<=n; i++) {
dp[i] = dp[i-1]+dp[i-2];
}
return dp[n];
}
}
斐波那契数列
最新推荐文章于 2023-10-31 11:28:12 发布
class Solution {
public int fib(int n) {
if (n<=1) {
return n;
}
int[] dp = new int[n+1];
dp[0] = 0;
dp[1] = 1;
for(int i=2; i<=n; i++) {
dp[i] = dp[i-1]+dp[i-2];
}
return dp[n];
}
}