781. Rabbits in Forest

In a forest, each rabbit has some color. Some subset of rabbits (possibly all of them) tell you how many other rabbits have the same color as them. Those answers are placed in an array.

Return the minimum number of rabbits that could be in the forest.

Examples:
Input: answers = [1, 1, 2]
Output: 5
Explanation:
The two rabbits that answered "1" could both be the same color, say red.
The rabbit than 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.

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

Input: answers = []
Output: 0

Note:

answers will have length at most 1000.
Each answers[i] will be an integer in the range [0, 999].

Intuition

每个有不同数字的兔子，它们的颜色肯定也不一样。因为一个兔子只会告诉我们关于它的颜色的信息。所以我们可以对于每个颜色的兔子来分开计数。

比如有 13 兔子的回答是 5 。这代表什么？假设其中一个兔子是红色，那么这当中就会有另外 5 只红色兔子，并且这 5 只兔子的回答也是 5 ，并且没有更多红色兔子了。所以，假设其中另外一个颜色是蓝色，那么这当中会有另外 5 只蓝色兔子。最后，假设另外一个颜色是绿色，那么会有另外 5 只绿色兔子，注意此时 13 只兔子不够了，说明其他的绿色兔子是在森林中，不在这 13 只中。

所以答案是至少有 18 只兔子，因为至少有 3 种不同颜色，并且每种颜色有 6 只兔子。

Algorithm

总之, 如果有 v 只兔子的回答是 k，(其中 v = count[k] )，那么至少有 a 只兔子也会回答 k，(已经回答了/还在森林中)，其中 a 是当 a >= v 时， k+1 的最小倍数。

之后我们将所有的 a 加到一起。

class Solution {
    public int numRabbits(int[] answers) {
        int res = 0;  
        int len = answers.length;  
        if (len == 0)  
            return 0;  
        Map<Integer, Integer> map = new HashMap<>();  
        for (int answer : answers) {  
            map.put(answer, map.getOrDefault(answer, 0) + 1);  
        }  
        for (Integer n : map.keySet()) {  
            int group = map.get(n) / (n + 1);  
            if (map.get(n) % (n + 1) == 0) {  
                res += group * (n + 1);  
            } else {  
                res += (group + 1) * (n + 1);  
            }  
        }  
        return res;  
    }
}