Java青蛙跳台阶问题

public static int frogJump(int n) {
        //青蛙跳台阶问题 //1,2,3,5,8斐波那契数列
        if (n == 1) {
            return 1;
        }
        if (n == 2) {
            return 2;
        }
        return frogJump(n-1) + frogJump(n-2);
    }
    public static void main(String[] args) {
        System.out.println(frogJump(5));
    }

输出结果：