【华为oj】m个苹果方n个盘子，多少种方法？

样例输入
7 3
样例输出
8
/**
     * 计算放苹果方法数目
    * 输入值非法时返回-1
     * 1 <= m,n <= 10<><= m,n <= 10<>
     * @param m 苹果数目
     * @param n 盘子数目数
     * @return 放置方法总数
     * 
     */

import java.util.Scanner;

public class  Main
{
	public static void main(String[] args)
	{
        Scanner cin = new Scanner(System.in);
        int M = cin.nextInt();
        int N = cin.nextInt();
        int OUT = ShareApple(M,N); 
		System.out.println(OUT);
		cin.close();
	}

	private static int ShareApple(int m, int n) {
		// TODO Auto-generated method stub
		if(m == 1 || n == 1)
			return 1;
		if(m < n)
			return ShareApple(m , m);
		else if(m > n)
			return ShareApple(m, n-1) + ShareApple(m-n, n);
		else
			return 1 + ShareApple(m, n-1);
	}

	
}