简单做
斐波那契数列
http://www.nowcoder.com/questionTerminal/c6c7742f5ba7442aada113136ddea0c3
public class Solution {
public int Fibonacci(int n) {
if(n < 2){
return n;
}
int a = 0;
int b = 1;
for(int i = 1; i < n; i++){
b = a + b;
a = b - a;
}
return b;
}
}
美团一面810人在聊