【LintCode-366】斐波纳契数列 (Java实现)

public class Solution {
/*
* @param n: an integer
* @return: an ineger f(n)
*/
public int fibonacci(int n) {
int a=0;
int b=1;
int c=0;
if(n==1)
return 0;
if(n==2)
return 1;
while(n-2>0){
c=a+b;
a=b;
b=c;
n--;
}
return c;
}
}