Leetcode - 509 Fibonacci Number (Easy)
public int fib(int N) {
if (N <= 1) return N;
int a = 0, b = 1;
while (N-- >= 2) {
int tmp = b;
b = a + b;
a = tmp;
}
return b;
}
Leetcode - 509 Fibonacci Number (Easy)
public int fib(int N) {
if (N <= 1) return N;
int a = 0, b = 1;
while (N-- >= 2) {
int tmp = b;
b = a + b;
a = tmp;
}
return b;
}