mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
25 lines
764 B
HTML
25 lines
764 B
HTML
<p>把n个骰子扔在地上，所有骰子朝上一面的点数之和为s。输入n，打印出s的所有可能的值出现的概率。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p>你需要用一个浮点数数组返回答案，其中第 i 个元素代表这 n 个骰子所能掷出的点数集合中第 i 小的那个的概率。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1:</strong></p>
|
||
|
||
<pre><strong>输入:</strong> 1
|
||
<strong>输出:</strong> [0.16667,0.16667,0.16667,0.16667,0.16667,0.16667]
|
||
</pre>
|
||
|
||
<p><strong>示例 2:</strong></p>
|
||
|
||
<pre><strong>输入:</strong> 2
|
||
<strong>输出:</strong> [0.02778,0.05556,0.08333,0.11111,0.13889,0.16667,0.13889,0.11111,0.08333,0.05556,0.02778]</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>限制：</strong></p>
|
||
|
||
<p><code>1 <= n <= 11</code></p>
|