Leetcode - 509 Fibonacci Number (Easy)
F(0) = 0, F(1) = 1
F(N) = F(N - 1) + F(N - 2), for N > 1.
public int fib(int N) {
if(N <= 1) return N;
int f1 = 0, f2 = 1;
for(int i = 2; i <= N; i++){
int t = f2;
f2 = f1 + f2;
f1 = t;
}
return f2;
}