Leetcode 从易入难 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.

给一个偶数整型数组，每个不同的数字相当于不同的糖果。把这些糖果平均的分配给弟弟妹妹，但是要求是妹妹分到尽可能多的种类的糖果。
我的思路是用vector的函数进行排序，再遍历计算不同种类个数。因为是一人分一半糖果，如果糖果种类大于糖果总数的一半，那么女孩最多拿到那一半的数量的糖果种类；如果糖果种类小于一半，那么女孩拿到糖果种类的数量等于一共有的糖果种类。

class Solution {
public:
    int distributeCandies(vector<int>& candies) {
        int res=0;  //注意不要丢失了赋值res
    sort(candies.begin(),candies.end());
    if(candies.size()%2!=0) //如果不是偶数直接返回0
        return 0;
    for(int i = 0;i<candies.size();i++){
        if(i==0||candies[i]!=candies[i-1])
            res++;
    }
    if(res>=(candies.size()/2))
        return candies.size()/2;
    if(res < (candies.size()/2))
        return res;
    }
};