斐波那契数列无需递归:
public class Solution {
public int Fibonacci(int n) {
int a = 0, b = 1;
for (int i = 1; i <= n; i++) {
a = a + b;
b = a - b;
}
return a;
}
}
public class Solution {
public int Fibonacci(int n) {
int a = 0, b = 1;
for (int i = 1; i <= n; i++) {
a = a + b;
b = a - b;
}
return a;
}
}
全部评论
相关推荐
02-27 14:25
咸阳师范学院 运营 点赞 评论 收藏
分享
拼多多集团-PDD成长空间 982人发布