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:

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

思路比较简单：

比如[2,2]，则最少可能又3只兔子，因为这里面只是说了有些兔子并不在列表中。

如果[2,2,2]，最少可能只有3只兔子颜色相同

如果[2,2,2,2]，最少可能有6只

如果[2,2,2,2,2]，最少可能也只有6只

如果[2,2,2,2,2,2]，最少可能也只有6只

会发现，这里面有一个取整的关系。

程序如下所示：

class Solution {
    public int numRabbits(int[] answers) {
        Map<Integer, Integer> map = new HashMap<>();
        Set<Integer> set = new HashSet<>();
        for (int v : answers){
            map.put(v, map.getOrDefault(v, 0) + 1);
        }
        int cnt = 0;
        for (int v : answers){
            if (!set.contains(v)){
                int n = map.get(v);
                int part = n/(v+1);
                int rest = ((n%(v+1)) == 0)?0:1;
                cnt += part*(v+1) + rest*(v+1);
                set.add(v);
            }
        }
        return cnt;
    }
}