【CODE】Rabbits in Forest

781. Rabbits in Forest

Medium

192238FavoriteShare

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

• 有n个兔子，其中一部分被抓来说有多少个与自己颜色一样。问最少的兔子数量是多少。
• 如果某兔子回答x，那么说明有x+1个相同颜色的兔子，最多有x+1个兔子可以回答x，如果有超过x+1个兔子回答了x，那么就要再加上x+1个新兔子（这些新兔子拥有不同的颜色）。

class Solution {
public:
    int numRabbits(vector<int>& answers) {
        map<int,int> mp;
        int res=0;
        for(int i=0;i<answers.size();i++){
            if(mp[answers[i]]==0) res+=answers[i]+1;
            mp[answers[i]]++;
            if(mp[answers[i]]>answers[i]+1){
                mp[answers[i]]-=answers[i]+1;
                res+=answers[i]+1;
            }
        }
        return res;
    }
};

• Runtime: 8 ms, faster than 37.92% of C++ online submissions for Rabbits in Forest.
• Memory Usage: 9 MB, less than 50.00% of C++ online submissions for Rabbits in Forest.
• Next challenges:
• Best Meeting Point
• Brick Wall
• Digit Count in Range