leetcode575+分糖果种类数尽量多，hash

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/u013554860/article/details/82314349

https://leetcode.com/problems/distribute-candies/description/

class Solution {
public:
    int distributeCandies(vector<int>& candies) { //最多是一半
        map<int, int> CandyCount;
        for(auto candy:candies){
            CandyCount[candy]+=1;
        }
        int size = candies.size()/2;
        return CandyCount.size() > size? size: CandyCount.size();
    }
};