781. 森林中的兔子
class Solution {
public:
int numRabbits(vector<int>& answers) {
int len = answers.size();
if(len == 0) return 0;
else{
int ans = 0;
sort(answers.begin(), answers.end());
for(int i = 0; i < len; i++){
int cur = answers[i];
ans += (cur + 1);
int k = 0;
while(k < cur && i+1 < len && cur == answers[i + 1]){
i++, k++;
}
}
return ans;
}
}
};