【刷leetcode，拿Offer-008】575. Distribute Candies（贪心）

本文链接：https://blog.csdn.net/david_jett/article/details/77568268

本篇博客主要介绍LeetCode第575题——Distribute Candies的解决方案。题目要求将不同种类的糖果均匀分配给兄妹两人，目标是使妹妹获得的糖果种类数最多。通过使用贪心策略，计算糖果种类数，如果超过总数的一半，则妹妹可以获得一半种类的糖果，否则可以获得全部种类。示例和代码解析详尽，适合LeetCode入门和C++贪心算法学习。

摘要由CSDN通过智能技术生成

题目链接

题面：

575. Distribute Candies

Description Hints Submissions Discuss Solution

Discuss Pick 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: 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: 2
Explanation: 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);
}
};