leetcode.781. Rabbits in Forest
There is a forest with an unknown number of rabbits. We asked n rabbits "How many rabbits have the same color as you?" and collected the answers in an integer array answers where answers[i] is the answer of the ith rabbit.
Given the array answers, return the minimum number of rabbits that could be in the forest.
Example 1:
Input: answers = [1,1,2]Output: 5Explanation:The two rabbits that answered "1" could both be the same color, say red. The rabbit that 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.
Example 2:
Input: answers = [10,10,10]Output: 11
Constraints:
1 <= answers.length <= 10000 <= answers[i] < 1000
分析说每个数字的兔子的数量，比如说1的兔子只有1个的话，那么这个颜色的兔子最多就是2个。说1的兔子有2个的话，也是最多2个，但是有3个的话，兔子最多就是4个。所以这时候，我们要判断说的数量跟n+1的值对比，除余之后是0的话，那么兔子的数量就是商*（数量+1）；
还好一次过了。
Runtime: 10 ms, faster than 20.77% of Java online submissions for Rabbits in Forest.
Memory Usage: 43.2 MB, less than 18.42% of Java online submissions for Rabbits in Forest.
