LeetCode——575. Distribute Candies(贪心)
来源:互联网 发布:碳足迹 水足迹 数据 编辑:程序博客网 时间:2024/05/16 17:38
题目链接
题面:
575. Distribute Candies
DescriptionHintsSubmissionsDiscussSolution
DiscussPick One
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].
解题:
利用贪心的思想,统计糖的种类数,如果糖的种类数大于等于总颗数/2,那就是总颗数/2,反之就是总种类数。
代码:
class Solution {
public:
int distributeCandies(vector<int>& candies) {
int res;
set <int> cnt;
for(int i=0;i<candies.size();i++)
cnt.insert(candies[i]);
return res=min(cnt.size(),candies.size()/2);
}
};
public:
int distributeCandies(vector<int>& candies) {
int res;
set <int> cnt;
for(int i=0;i<candies.size();i++)
cnt.insert(candies[i]);
return res=min(cnt.size(),candies.size()/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
- 管理Xcode插件的插件
- 函数名与函数指针
- android exoplayer的使用
- 多线程基础四(三)、暂停线程
- spice协议详解(二):spice支持功能和优势
- LeetCode——575. Distribute Candies(贪心)
- CoreData增删改查简单操作及多线程添加数据
- HDU4768 Flyer 二分|异或的性质|暴力
- POJ 2253(dijkstral变形超级简单)
- Map/Reduce原理
- 优化方法(C++)——0.618法、平均值法、单纯形法
- RFC文档(中文翻译版本)
- linux硬链接与软链接
- shiro学习-基础介绍(一)