575. Distribute Candies

最新推荐文章于 2022-08-10 19:04:47 发布

YHJunE

最新推荐文章于 2022-08-10 19:04:47 发布

阅读量200

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode刷题

本文链接：https://blog.youkuaiyun.com/yanhangy/article/details/77771434

leetcode刷题专栏收录该内容

33 篇文章

订阅专栏

解决一个整数数组中的糖果分配问题，确保兄妹两人获得相同数量的糖果，并最大化妹妹能获得的不同种类糖果的数量。通过使用集合来统计不同种类糖果的种类数，并判断是否超过了每人分配的一半数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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) {
        set<int> st(candies.begin(), candies.end());
        if(st.size() < candies.size() / 2){
            return st.size();
        }else{
            return candies.size() / 2;
        }
    }
};

在STL中，set是以红黑树（RB-Tree）作为底层数据结构的。set可以在时间复杂度为O（logN）的情况下插入，删除和查找数据。
因此时间复杂度为O(NlogN)

leetcode上的解答：

The idea is to use biset as hash table instead of unordered_set.

int distributeCandies(vector<int>& candies) {
        bitset<200001> hash;
        int count = 0;
        for (int i : candies) {
            if (!hash.test(i+100000)) {
               count++;
               hash.set(i+100000);
            }
        }
        int n = candies.size();
        return min(count, n/2);
    }

时间复杂度应该为O（N）