mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
存量题库数据更新
This commit is contained in:
@@ -3,7 +3,7 @@
|
||||
<p>Given the array <code>answers</code>, return <em>the minimum number of rabbits that could be in the forest</em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> answers = [1,1,2]
|
||||
@@ -16,7 +16,7 @@ Then there should be 2 other blue rabbits in the forest that didn't answer i
|
||||
The smallest possible number of rabbits in the forest is therefore 5: 3 that answered plus 2 that didn't.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> answers = [10,10,10]
|
||||
|
Reference in New Issue
Block a user