mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -9,7 +9,7 @@
|
||||
<p>Answers within <code>10<sup>-5</sup></code> of the actual answer are considered accepted.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 10, k = 1, maxPts = 10
|
||||
@@ -17,7 +17,7 @@
|
||||
<strong>Explanation:</strong> Alice gets a single card, then stops.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 6, k = 1, maxPts = 10
|
||||
@@ -26,7 +26,7 @@
|
||||
In 6 out of 10 possibilities, she is at or below 6 points.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 3:</strong></p>
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> n = 21, k = 17, maxPts = 10
|
||||
|
Reference in New Issue
Block a user