动态规划之n个骰子的点数出现概率

class Solution {
    public double[] dicesProbability(int n) {
      double []res=new double[6*n-n+1];
      int [][]dp=new int[n+1][6*n+1];
      for(int i=1;i<=6;i++){
          dp[1][i]=1;
      }
      for(int i=2;i<=n;i++){
          for(int j=i;j<=6*n;j++){
              for(int cur=1;cur<=6;cur++){
                  if(j-cur<=0)break;
                  dp[i][j]+=dp[i-1][j-cur];
              }
          }
      }
      double total=Math.pow(6,n);
      for(int i=0;i<res.length;i++){
          res[i]=1.0/total*dp[n][i+n];
      }
      return res;
    }
}