[leetcode-575-Distribute Candies]

标签：integer   style   tor   turn   统计   exp   class   could   where   

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

思路：

用一个map统计每种蜡烛的的个数，同时能够得到总共的蜡烛种类数，如果种类数很少，少于蜡烛总数一半，则返回种类数。

如果种类数很多，多余蜡烛总数一半，返回蜡烛总数一半。

int distributeCandies(vector<int>& candies)
 {
     int total = candies.size();
     map<int,int>candyKind;
     for(int i =0;i<total;i++)
     {
         candyKind[candies[i]]++;
     }
     int kind = candyKind.size();
     if(kind<=total/2) return kind;
     else return total/2;
}

[leetcode-575-Distribute Candies]

标签：integer   style   tor   turn   统计   exp   class   could   where   

原文地址：http://www.cnblogs.com/hellowooorld/p/6820196.html