n个骰子的点数

题目
把n个骰子扔在地上，所有骰子朝上一面的点数之和为s。输入n，打印出s的所有可能出现的值出现的概率。
解题思路

• 将n个骰子分为两堆，第一堆只有一个，剩下的一堆有n-1个
• 然后计算n-1个骰子的点数之和，过程和第一步一样
• 总共n个骰子，有6^n中排列组合，骰子点数之和在n到6n之间，所以可以用5n+1的数组来存放出现点数之和的次数，将和为s的点数存放在数组的第s-n个元素中
  源代码

package Arithmetic;

import java.util.AbstractMap;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;

public class DicesSum {
    private static int maxValue = 6;

    public static List<Map.Entry<Integer, Double>> printProability(int number) {
        List<Map.Entry<Integer, Double>> ret = new ArrayList<>();
        if (number < 1)
            return ret;
        int maxSum = maxValue * number;//最大值为6n
        int[] a = new int[maxSum - number + 1];
        for (int i = number; i < maxSum; i++) {
            a[i - number] = 0;
        }
        Proability(number, a);
        double total = Math.pow(maxSum, number);
        for (int i = number; i <= maxSum; i++) {
            double ratio = a[i - number] / total;
            ret.add(new AbstractMap.SimpleEntry<>(i, ratio));
        }
        return ret;
    }

    private static void Proability(int number, int[] a) {
        for (int i = 1; i <= maxValue; i++) {
            Proability(number, number, i, a);
        }
    }

    private static void Proability(int original, int current, int sum, int[] a) {
        if (current == 1)
            a[sum - original]++;
        else {
            for (int i = 1; i <= maxValue; i++)
                Proability(original, current - 1, sum + i, a);
        }
    }

    public static void main(String[] args) {
        System.out.println(printProability(100));
    }
}