Beats 90% Java Solution


  • 0
    public class Solution {
        public int distributeCandies(int[] candies) {
            HashSet<Integer> set = new HashSet();
            for(int i = 0; i < candies.length; ++i) {
                set.add(candies[i]);
            }
            
            return candies.length/2 >= set.size() ? set.size() : candies.length/2;
        }
    }
    ``

Log in to reply
 

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