1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
| class Solution {
public int numRabbits(int[] answers) {
int[] countMap = new int[1000];
int rabbits = 0;
for (int answer : answers) {
if (countMap[answer] > 0) {
countMap[answer]--;
} else {
rabbits += answer + 1;
countMap[answer] = answer;
}
}
return rabbits;
}
}
|
References
781. Rabbits in Forest
【负雪明烛】找规律，附「向上取整」转「向下取整」的证明