payal-kothari
7/24/2017 - 8:44 PM

From https://leetcode.com/problems/distribute-candies/#/discuss

public class Solution {
    public int distributeCandies(int[] candies) {
        
       Set<Integer> sis = new HashSet<>();
        
       for(int candy : candies){
           sis.add(candy);
       }
        
      int halfCandies = candies.length /2;
        
      return sis.size() >= halfCandies ? halfCandies : sis.size() ;
    
 }
}