标签：分析 hashmap his different code 参考 shm too present
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:
Java Solution:
Runtime beats 90.78%
完成日期：06/07/2017
关键词：HashMap
关键点：分析可能性
1 public class Solution 2 { 3 public int distributeCandies(int[] candies) 4 { 5 HashSet<Integer> set = new HashSet<>(); 6 7 for(int i=0; i<candies.length; i++) 8 set.add(candies[i]); 9 10 // if candy number for sister >= the number of kinds for candies -> kinds 11 // if candy number for sister < the number of kinds for candies -> candy number 12 return Math.min(set.size(), candies.length/2); 13 } 14 }
参考资料：N/A
LeetCode 575. Distribute Candies （发糖果）
标签：分析 hashmap his different code 参考 shm too present
原文地址：http://www.cnblogs.com/jimmycheng/p/7092460.html
