《剑指Offer（第二版）》面试题60. n个骰子的点数

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

你需要用一个浮点数数组返回答案，其中第 i 个元素代表这 n 个骰子所能掷出的点数集合中第 i 小的那个的概率。

示例 1:
输入: 1
输出: [0.16667,0.16667,0.16667,0.16667,0.16667,0.16667]

示例 2:
输入: 2
输出: [0.02778,0.05556,0.08333,0.11111,0.13889,0.16667,0.13889,0.11111,0.08333,0.05556,0.02778]

限制：
1 <= n <= 11

class Solution:
    def twoSum(self, n: int) -> List[float]:
        dp = [([0]*(6*n+1)) for i in range(n+1)]# 注意浅拷贝问题
        
        for i in range(1, 7):
            dp[1][i] = 1

        for i in range(2, n+1):
            for s in range(i, 6*i+1):
                for j in range(1, 7):
                    if s-j <=0:
                        break
                    dp[i][s] = dp[i][s] + dp[i-1][s-j]        
            
        return [i/pow(6, n) for i in dp[n][n:6*n+1]]