LeetCode: 575 Distribute Candies(easy)

最新推荐文章于 2022-10-31 17:43:08 发布

玲珑子_a

最新推荐文章于 2022-10-31 17:43:08 发布

阅读量222

点赞数 1

分类专栏： LeetCode学习笔记

本文链接：https://blog.csdn.net/lxin_liu/article/details/85006556

版权

LeetCode学习笔记专栏收录该内容

30 篇文章 0 订阅

订阅专栏

本文探讨了在给定包含偶数长度的整数数组中，不同数字代表不同种类糖果的情况下，如何将糖果平均分配给兄妹两人，使妹妹获得尽可能多的糖果种类。通过排序和栈操作，实现了高效算法，返回妹妹可能获得的最大糖果种类数。

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

题目：

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].

代码：

class Solution {
public:
    int distributeCandies(vector<int>& candies) {
        stack<int> tem;
        sort(candies.begin(), candies.end());
        tem.push(candies[0]);
        for (auto c : candies) {
            if ( c != tem.top())
                tem.push(c);
        }
        if ( tem.size() > candies.size()/2)
            return candies.size()/2;
        else
            return tem.size();
    }
};

运行时间：276ms