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. 

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

题意，给一个数字，长度为偶数，表示不同类型的糖果。需要把糖果平分给兄妹俩，求妹妹可以获得多少种类型的糖果

public class Solution {
    public int DistributeCandies(int[] candies) {
        if(candies.Length == 0){
            return 0;
        }
		Dictionary<int, int> dict = new Dictionary<int, int>();
		for (int i = 0; i < candies.Length; i++) {
			int value = 0;
			int key = candies[i];
			dict.TryGetValue(key, out value);
			if (value > 0) {
				dict[key]++;
			} else {
				dict[key] = 1;
			}
		}
		return dict.Count >= candies.Length/2 ? candies.Length/2 : dict.Count;
    }
}

null