求斐波那契数列的第n项

public class Fibonacci20170913 {    public static void main(String[] args) {        // TODO Auto-generated method stub        Fibonacci20170913 fibonacci20170913=new Fibonacci20170913();        System.out.println(fibonacci20170913.Fibonacci1(5));        System.out.println(fibonacci20170913.Fibonacci2(5));    }    //递归    public int Fibonacci1(int n){        if (n==0)            return 0;        else if(n==1)            return 1;        else {            return Fibonacci1(n-1)+Fibonacci1(n-2);        }    }    //动态规划    public int Fibonacci2(int n){        if(n==0)            return 0;        else if (n==1)            return 1;        else {            int f0=0;            int f1=1;            int result=0;            for(int i=2;i<=n;i++){                result=f0+f1;                f0=f1;                f1=result;            }            return result;        }    }}