575. Distribute Candies 简单数学题

Given an integer array with even length, where different numbers in thisarray represent different kinds of candies. Each number means one candy of the correspondingkind. You need to distribute these candies equally in number to brother and sister. Return themaximum number of kinds of candies the sister could gain.

Example1:

Input: candies = [1,1,2,2,3,3]

Output: 3

Explanation:

There are three different kinds of candies (1, 2 and 3), andtwo candies for each kind.

Optimal distribution: The sister has candies [1,2,3] and thebrother has candies [1,2,3], too.

The sister has three different kinds of candies.

Example2:

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 brotherhas only one kind of candies.

Note:

1.      The length of the given array is inrange [2, 10,000], and will be even.

2.      The number in given array is in range[-100,000, 100,000].

简单题，这一题问你将饼干平分为两份，问你姐姐能得到的最多的饼干种类最多是多少，很明显，假设姐姐得到n块饼干，一共有2n块饼干，共有m种不同的饼干，姐姐每一种都拿一个得到的饼干总数是最多的，因此姐姐得到的饼干总数最多为min(m,n)

当统计不同饼干的数目的时候可能会有人想到使用自己写的数组，但是这样的话统计时间是O(n^2)，假如使用map会快很多，因为map的查询时间是O(logn)，使用map[i]++，就能很容易的得到饼干的种数

class Solution {
public:
int distributeCandies(vector<int>& candies) {
	unordered_map <int, int> mark;
	for (auto u : candies) {
		mark[u]++;
	}
	return min(mark.size(),candies.size()/2);
}
};