上台阶问题（递归）

运用递归的思路

import java.util.Scanner;

public class Main
{
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        Main m = new Main();
        while (sc.hasNext())
        {
            // m级
            int num = sc.nextInt();
            for (int i = 0; i < num; i++)
            {
                System.out.println(m.Fan(sc.nextInt()));
            }
        }
        sc.close();

    }

    public int Fan(int n)
    {
        if (n == 1)
            return 0;
        if (n == 2)
            return 1;
        if (n == 3)
            return 2;
        return Fan(n - 1) + Fan(n - 2);
    }
}