java求斐波那契数列

public class test3 {
    public static long fib(long num) {
        if ((num == 0) || (num == 1))
            return num;
        else
            return fib(num - 1) + fib(num - 2);
    }

    public static void main(String[] args) {
        for (int i = 1; i <= 20; i++) {
            System.out.println(fib(i));
        }
    }
}//递归方法
public class test4 {
    public static long fib(int num) {
      if((num==1)||(num==2))
          return 1;
      long[] arr=new long[num];
      arr[0]=arr[1]=1;
      for(int i=2;i<num;i++){
          arr[i]=arr[i-1]+arr[i-2];

      }
        return arr[num-1];
    }
    public static void main(String args[]){
        for(int i=1;i<=20;i++){
            System.out.println(fib(i));
        }
    }
}//数列方法