import java.util.HashSet;

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

 */

public class Distribute_Candies {

	public class Solution {
	    public int distributeCandies(int[] candies) {
	        if (candies == null || candies.length == 0) {
	            return 0;
	        }

	        // use a set to count unique types
	        HashSet<Integer> hs = new HashSet<>();

	        for(int each: candies) {
	            hs.add(each);
	        }

	        int unique = hs.size();

	        // if unique is more than half, then always half types
	        return unique >= candies.length / 2? candies.length / 2: unique;
	    }
	}
}

############

class Solution {
    public int distributeCandies(int[] candyType) {
        Set<Integer> s = new HashSet<>();
        for (int c : candyType) {
            s.add(c);
        }
        return Math.min(candyType.length >> 1, s.size());
    }
}

// OJ: https://leetcode.com/problems/distribute-candies/
// Time: O(N)
// Space: O(N)
class Solution {
public:
    int distributeCandies(vector<int>& candies) {
        unordered_set<int> m(candies.begin(), candies.end());
        return min(m.size(), candies.size() / 2);
    }
};

class Solution:
    def distributeCandies(self, candyType: List[int]) -> int:
        return min(len(candyType) >> 1, len(set(candyType)))

############

class Solution(object):
  def distributeCandies(self, candies):
    """
    :type candies: List[int]
    :rtype: int
    """
    return min(len(candies) / 2, len(set(candies)))

func distributeCandies(candyType []int) int {
	s := hashset.New()
	for _, c := range candyType {
		s.Add(c)
	}
	return min(len(candyType)>>1, s.Size())
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

class Solution {
    public int distributeCandies(int[] candies) {
        int length = candies.length;
        int numOfCandies = length / 2;
        Set<Integer> set = new HashSet<Integer>();
        for (int candy : candies)
            set.add(candy);
        return Math.min(numOfCandies, set.size());
    }
}

############

class Solution {
    public int distributeCandies(int[] candyType) {
        Set<Integer> s = new HashSet<>();
        for (int c : candyType) {
            s.add(c);
        }
        return Math.min(candyType.length >> 1, s.size());
    }
}

// OJ: https://leetcode.com/problems/distribute-candies/
// Time: O(N)
// Space: O(N)
class Solution {
public:
    int distributeCandies(vector<int>& candies) {
        unordered_set<int> m(candies.begin(), candies.end());
        return min(m.size(), candies.size() / 2);
    }
};

class Solution:
    def distributeCandies(self, candyType: List[int]) -> int:
        return min(len(candyType) >> 1, len(set(candyType)))

############

class Solution(object):
  def distributeCandies(self, candies):
    """
    :type candies: List[int]
    :rtype: int
    """
    return min(len(candies) / 2, len(set(candies)))

func distributeCandies(candyType []int) int {
	s := hashset.New()
	for _, c := range candyType {
		s.Add(c)
	}
	return min(len(candyType)>>1, s.Size())
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

575 - Distribute Candies

All Problems

All Solutions

Welcome to Subscribe On Youtube

All Problems

All Solutions