zoukankan      html  css  js  c++  java
  • LC 781. Rabbits in Forest

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

    Runtime: 4 ms, faster than 92.37% of C++ online submissions for Rabbits in Forest.

    class Solution {
    public:
      int numRabbits(vector<int>& answers) {
        unordered_map<int,int> mp;
        for(auto& a : answers){
          mp[a]++;
        }
        int ret = 0;
        for(auto it = mp.begin(); it!=mp.end(); it++){
            int m = it->second % (it->first + 1);
            if(m == 0){
              ret += it->second;
            }else{
              ret += it->first+1 - m + it->second;
            }
        }
        return ret;
      }
    };
  • 相关阅读:
    意见汇总
    软件工程团队项目第一次Sprint评审
    《Gogoing》Alpha版使用说明
    5月21日冲刺结束
    5月17日--5月20日站立会议
    5月12日--5月16站立会议
    山药蛋团队每日站立会议
    山药蛋团队成员一周冲刺详细计划表
    站立会议 第十天
    站立会议 第九天
  • 原文地址:https://www.cnblogs.com/ethanhong/p/10219536.html
Copyright © 2011-2022 走看看