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

解答

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

public class Solution {// 先排序；然后从小到大遍历数组；每多一种数字就给max+1；max最大值为数组的一半；
	public int distributeCandies(int[] candies) {
		Arrays.sort(candies);// Arrays中的排序方法为经过调优后的快速排序；
		int l = candies.length;
		int max = 1;
		for (int i = 1; i < l; i++) {
			if (max == l / 2) {
				break;
			}
			if (candies[i] > candies[i - 1]) {
				max++;
			}
		}
		return max;
	}
}