Distribute Candies

Distribute Candies

int distributeCandies(vector& candies) {

    int cnt = 1;
    //初始有一种
    int N = candies.size();

    sort(candies.begin(), candies.end());

    for(int i = 1; i < N; i ++) {

        if(candies[i] > candies[i - 1]) {

            cnt ++;

        }

    }

    return cnt < (N / 2) ? cnt : (N / 2);

}