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;
      }
    };
  • 相关阅读:
    [NodeJS] Node.js 编码转换
    [SublimeText] 如何创建工程
    浏览器 user-agent 字符串的故事
    [Ubuntu] geoip-bin 程序包
    在 Ubuntu 中安装 MySQL 指南
    在 Ubuntu 13.10 安装 PyCharm 3.0.1 & Oracle JDK
    [Command] lrzsz
    [Linux] 如何修改 Linux 主机名
    如何在 Ubuntu 中安装 Node.js
    [Linux] 修改用户名密码
  • 原文地址:https://www.cnblogs.com/ethanhong/p/10219536.html
Copyright © 2011-2022 走看看