DistributeCandies
来源:互联网 发布:淘宝店铺违规怎么申诉 编辑:程序博客网 时间:2024/05/19 00:49
Distribute Candies
第5天 第10题
Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of the corresponding kind. You need to distribute these candies equally in number to brother and sister. Return the maximum number of kinds of candies the sister could gain.
Example 1:
Input: candies = [1,1,2,2,3,3]Output: 3
Explanation:
There are three different kinds of candies (1, 2 and 3), and two candies for each kind.Optimal distribution: The sister has candies [1,2,3] and the brother has candies [1,2,3], too.The sister has three different kinds of candies.
Example 2:
Input: candies = [1,1,2,3]Output: 2Explanation: For example, the sister has candies [2,3] and the brother has candies [1,1].The sister has two different kinds of candies, the brother has only one kind of candies.
代码
int distributeCandies(vector<int>& candies) { unordered_map<int, int> map{}; for (auto candiesIter = candies.begin(); candiesIter != candies.end(); candiesIter++) { if(map.count(*candiesIter)==0) { map[*candiesIter]=1; } else{ map[*candiesIter]++; } } if(map.size()>=(candies.size()/2)) return candies.size()/2; else return map.size(); }
unordered_map<int, int> map(candies.size()); for (auto candiesIter = candies.begin(); candiesIter != candies.end() &&map.size()>=(candies.size()/2); candiesIter++) { if(map.count(*candiesIter)) { map[*candiesIter]=1; } else{ map[*candiesIter]++; } } if(map.size()>=(candies.size()/2)) return candies.size()/2; else return map.size();
阅读全文
1 0
- DistributeCandies
- 用Java和webmagic爬取图片并下载到本地(动态网页)
- mysql 表索引的一些注意事项
- 404报错:The server cannot or will not process the request due to something that is perceived to be a c
- 查找子集,并分类返回
- 尝试对知乎网验证码进行处理:
- DistributeCandies
- Javascript学习笔记_封装
- Android哪些权限需要动态授权
- 像看电影一样看Python程序运行:Livepython
- 在EXCEL中怎样批量把时间格式yyyy/mm/dd改为文本格式的yyyy-mm-dd
- cnmp解决npm下载安装缓慢问题
- 训练Tesseract
- 梯度下降小结
- 【基础】查看程序运行所需时间--C++源代码(g++ 4.9.3)