mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
33 lines
1.3 KiB
HTML
33 lines
1.3 KiB
HTML
<p>There is a forest with an unknown number of rabbits. We asked n rabbits <strong>"How many rabbits have the same color as you?"</strong> and collected the answers in an integer array <code>answers</code> where <code>answers[i]</code> is the answer of the <code>i<sup>th</sup></code> rabbit.</p>
|
|
|
|
<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>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> answers = [1,1,2]
|
|
<strong>Output:</strong> 5
|
|
<strong>Explanation:</strong>
|
|
The two rabbits that answered "1" could both be the same color, say red.
|
|
The rabbit that answered "2" can't be red or the answers would be inconsistent.
|
|
Say the rabbit that answered "2" was blue.
|
|
Then there should be 2 other blue rabbits in the forest that didn't answer into the array.
|
|
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>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> answers = [10,10,10]
|
|
<strong>Output:</strong> 11
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= answers.length <= 1000</code></li>
|
|
<li><code>0 <= answers[i] < 1000</code></li>
|
|
</ul>
|