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].

 

如果某个兔子回答的数字是x，那么说明森林里共有x+1个相同颜色的兔子，我们最多允许x+1个兔子同时回答x个，一旦超过了x+1个兔子，那么就得再增加了x+1个新兔子了。

class Solution {
    public int numRabbits(int[] answers) {
        int ans = 0;
        Map<Integer, Integer>map = new HashMap<>();
        for (int num : answers) {
            // 最多允许x+1个兔子同时回答x个
            if (!map.containsKey(num + 1) || map.get(num + 1) == 0) {
                // 一旦超过了x+1个兔子，那么就得再增加了x+1个新兔子了。
                ans += num + 1;
                map.put(num + 1, num);
            } else {
                map.put(num + 1, map.get(num + 1) - 1);
            }
        }
        return ans;
    }
}