面试题9.斐波那契数列

public class {
  public int Fibonacci(int n){
    if(n == 0)
      return 0;
    if(n == 1)
      return 1;
    if(n == 2)
      return 1;
    int FibFirst = 1;
    int FibSecond = 1;
    int FibResult = 0;
    for(int i = 3; i <= n ; i++){
      FibResult = FibFirst + FibSecond;
      FibFirst = FibSecond;
      FibSecond = FibResult;
    }
    return FibResult;
  }
}