Question

781. Rabbits in Forest

中文文档

Description

There is a forest with an unknown number of rabbits. We asked n rabbits "How many rabbits have the same color as you?" and collected the answers in an integer array answers where answers[i] is the answer of the ith rabbit.

Given the array answers, return _the minimum number of rabbits that could be in the forest_.

 

Example 1:

Input: answers = [1,1,2]
Output: 5
Explanation:
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.

Example 2:

Input: answers = [10,10,10]
Output: 11

 

Constraints:

• 1 <= answers.length <= 1000
• 0 <= answers[i] < 1000

Solutions

Solution 1

class Solution:
  def numRabbits(self, answers: List[int]) -> int:
    counter = Counter(answers)
    return sum([math.ceil(v / (k + 1)) * (k + 1) for k, v in counter.items()])

class Solution {
  public int numRabbits(int[] answers) {
    Map<Integer, Integer> counter = new HashMap<>();
    for (int e : answers) {
      counter.put(e, counter.getOrDefault(e, 0) + 1);
    }
    int res = 0;
    for (Map.Entry<Integer, Integer> entry : counter.entrySet()) {
      int answer = entry.getKey(), count = entry.getValue();
      res += (int) Math.ceil(count / ((answer + 1) * 1.0)) * (answer + 1);
    }
    return res;
  }
}