【Leetcode】《剑指offer-面试题43》n个骰子的点数
题目链接https://leetcode-cn.com/problems/nge-tou-zi-de-dian-shu-lcof/题目描述解题思路(1)递归解法import mathfrom typing import Listclass Solution: # 定义骰子最大点数 g_maxValue = 6 # 方法一:基于递归求骰子点数,时间效率不够高 def twoSum(self, n: int) -> List[float]