算法训练 未名湖边的烦恼

    设F(m,n)为m人还鞋，n人借鞋的排队种数。
    n为0时，F(m,n) = 1
    m<n时，F(m,n) = 0
    m>n时，F(m,n) = F(m-1,n)+F(m,n-1)

import java.util.Scanner;

public class Main {

    public static int Fuction(int m ,int n){
        if ( n == 0){
            return 1;
        }else if ( m < n){
            return 0;
        }else{
            return Fuction(m-1, n) + Fuction(m, n-1);
        }
    }

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner in = new Scanner(System.in);
        int m = in.nextInt();
        int n = in.nextInt();
        int sum = Fuction(m, n);
        System.out.print(sum);
        in.close();
    }

}