Clear java solution using set


  • 0
    public class Solution {
        public int distributeCandies(int[] candies) {
            Set<Integer> set = new HashSet<>();
            for(int candy : candies) {
                set.add(candy);
            }
            
            int kinds = set.size();
            if(kinds < candies.length / 2) {
                return kinds;
            }
            else {
                return candies.length / 2;
            }
        }
    }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.