用非递归的方法打印Fibonacci数列

[Bol5261]

public class S_Method5 {

    public static void main(String[] args){
        System.out.println("用非递归的方法打印Fibonacci数列:"+method(40));
    }
    public static int method(int n){
        int sum=0;
        int first=1,second=1;
        if(n<1){
            System.out.println("参数无效，输入的应为正整数");
            return -1;
        }
        if(n==1||n==2) return 1;
        for(int i=0;i<n-2;i++){
            sum=first+second;
            first=second;
            second=sum;
        }
        return sum;
    }
}


用非递归的方法打印Fibonacci数列:102334155

Process finished with exit code 0