575. Distribute Candies。

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

  ---

给定一个数组，数组的不同数字代表着不同的糖果种类，而且这个数目是偶数个。需要把这些糖果平均分配给sister和brother，求出sister得到的糖果中种类最多有多少种。

---

利用一个hash表来存放sister获得的糖果种类和数目，判断当前糖果种类是否已经存在hash表中了，不存在的话将其添加进去，同时需要注意sister获得糖果种类最多不能超过总糖果的1/2，毕竟是要平均分配的。

class Solution {
public:
    int distributeCandies(vector<int>& candies) {
        int result = 0;
        int maxResult = candies.size()/2;// sister得到的最大糖果种类数目
        unordered_map<int,int> sister;

        for(int i=0;i<candies.size();i++) {
            if(sister[candies[i]]++ == 0) {// 如果没找到说明sisiter没有这种糖果
                result++;
                if(result == maxResult)// 当达到最大的数目时就不再查找
                    break;
            }
        }
        return result;
    }
};