//f(0) f(1)
int pre = 0;
int cur = 1;
//cur is f(n)
for (int i = 2; i <= N; i++) {
int sum = pre + cur;
pre = cur;
cur = sum;
}
return cur;
//f(0) f(1)
int pre = 0;
int cur = 1;
//cur is f(n)
for (int i = 2; i <= N; i++) {
int sum = pre + cur;
pre = cur;
cur = sum;
}
return cur;
本文标题:Code Snip
本文链接:https://www.haomeiwen.com/subject/thkofktx.html
网友评论