Code Snip

斐波那契数

//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;