剑指offer-面试题43:n个骰子的点数

最新推荐文章于 2020-07-23 17:02:50 发布

铁蛋嘟嘟噜

最新推荐文章于 2020-07-23 17:02:50 发布

阅读量278

点赞数

分类专栏： leetcode 文章标签：剑指offer n个骰子的点数递归动态规划递推

本文链接：https://blog.csdn.net/weixin_42766102/article/details/103168024

版权

leetcode 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

扔n个骰子，求所有点数之和出现的概率
思路1：递归思想，扔一颗骰子，然后跟n-1个骰子的结果做计算
思路2：动态规划思想，递推，用一个数组保存n-1个骰子的概率结果。

class Solution1:
"""
递归方法
"""

    def getDicePointProbRecursively(self, n):
        if n == 0:
            return
        if n == 1:
            return [1 / 6] * 6
        res = [0] * (6 * n - n + 1)
        for prevPoint, prob in enumerate(self.getDicePointProbRecursively(n - 1)):
            for singlePoint in range(6):
                res[prevPoint + singlePoint] += prob * 1 / 6
        return res

    def printDicePointProb(self, n):
        arr = self.getDicePointProbRecursively(n)
        print(sum(arr))
        return [(index + n, prob) for index, prob in enumerate(arr)]


class Solution2:
"""
递推
"""
    def getDicePointProb(self, n):
        preSum = [1 / 6] * 6
        if n == 1:
            return preSum
        cnt = 2
        prevNTypes = 6
        while cnt <= n:
            # 计算n个骰子有多少种点数
            nTypes = 6 * cnt - cnt + 1
            curSum = [0] * nTypes
            for tsum in range(nTypes):
                for point in range(6):
                    restPoint = tsum - point
                    # 判断剩余的点数是否能由n-1个骰子掷出来
                    if restPoint >= 0 and restPoint < prevNTypes:
                        curSum[tsum] += preSum[restPoint] * 1 / 6
            prevNTypes = nTypes
            preSum = curSum
            cnt += 1
        return [(index + n, prob) for index, prob in enumerate(curSum)]


if __name__ == '__main__':
    s = Solution1()
    print(s.printDicePointProb(7))