求Fibonacii数列的第40个数

public class Fibonacii{
    
    public int m1(int n){
        
        if(n == 1||n == 2){
            return 1;
        }
        return m1(n-1) + m1(n-2);
    }
    
    public int m2(int n){
        
        if(n == 1||n == 2){
            return 1;
        }
        
        int i = 1;
        int j = 1;
        int result = 0;
        
        for(int count=3;count<=n;count++){
            result = i + j;
            i = j;
            j = result;
        }
        return result;
    }
    
    public static void main(String[] args){
        Fibonacii f = new Fibonacii();
        System.out.println(f.m1(40));
        System.out.println(f.m2(40));
    }
    
}