leedcode 781

781. Rabbits in Forest
     Medium

137

180

Favorite

Share
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

import java.util.ArrayList;

public class Solution {

    public int numRabbits(int[] answers) {
        int []c = new int[1000];
        int res=0;//结果总数
            for(int rab:answers){//遍历每一个数组元素
                
                
            if(c[rab]-- <= 0){//如果存储里面有就先看看是否为0，然后进行-- 假如answers{0，0，1，1，1}
                c[rab] = rab;如果此时元素为空则赋值在进行➕1
                res += rab +1;
               
            }
        }
            return res;
    }
}