575. Distribute Candies

标签：imu   represent   put   too   example   str   style   each   max   

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:

1. The length of the given array is in range [2, 10,000], and will be even.
2. The number in given array is in range [-100,000, 100,000].

把所有的糖平均分给两个人，问一个人最多能获得多少不同种类的糖

C++（275ms）：

1 class Solution {
2 public:
3     int distributeCandies(vector<int>& candies) {
4         int len = candies.size() ;
5         unordered_set<int> Set(candies.begin() , candies.end()) ;
6         int setLen = Set.size() ;
7         return min(setLen, len>>1) ;
8     }
9 };

575. Distribute Candies

标签：imu   represent   put   too   example   str   style   each   max   

原文地址：http://www.cnblogs.com/mengchunchen/p/7760160.html