LeetCode 575. Distribute Candies
来源:互联网 发布:巴洛特利废了知乎 编辑:程序博客网 时间:2024/05/22 23:16
题目链接:https://leetcode.com/problems/distribute-candies/#/description
题目描述:
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: 3Explanation: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.
Note:
- The length of the given array is in range [2, 10,000], and will be even.
- The number in given array is in range [-100,000, 100,000].
直接用哈希表,统计种类数,如果种类数大于总糖数的一半,结果就是后者,否则结果就是类型数
class Solution {public: int distributeCandies(vector<int>& candies) { int n=candies.size(); candies.erase(unique(candies.begin(),candies.end()),candies.end()); int m=candies.size(); return n/2>m?m:n/2; }};
阅读全文
0 0
- LeetCode | 575. Distribute Candies
- leetcode 575. Distribute Candies
- [LeetCode]575. Distribute Candies
- [leetcode]: 575. Distribute Candies
- [leetcode]575. Distribute Candies
- LeetCode 575. Distribute Candies
- leetcode.575. Distribute Candies
- LeetCode 575. Distribute Candies
- [LeetCode]575.Distribute Candies
- leetcode 575. Distribute Candies
- LeetCode: 575. Distribute Candies
- LeetCode#575. Distribute Candies
- LeetCode 575. Distribute Candies
- 【LeetCode】575. Distribute Candies
- [LeetCode]575. Distribute Candies
- [LeetCode]575. Distribute Candies
- <LeetCode>575. Distribute Candies
- leetcode 575. Distribute Candies
- Mybatis 用到的设计模式
- java、android可用的rtp封包解包h264
- Oracle创建序列,删除序列
- 【SpringBoot】SampleApplication最简单的Spring Boot创建;
- Laravel-mix及模板调用问题
- LeetCode 575. Distribute Candies
- 利用R语言分析挖掘Titanic数据集(三)
- 采购单
- Android多进程Process开发总结-优点与缺陷
- STL中const迭代器与const_iterator区别
- 从包中构建瓦片服务器
- Dubbo 设计模式
- 应用到文本领域的卷积方法
- httpd服务