Leetcode 575. 分糖果

class Solution:
    def distributeCandies(self, candyType: List[int]) -> int:
        candyType.sort()
        n = len(candyType)/2
        result = 0
        pre = None
        for a in candyType:
            if result >= n:
                break
            elif pre == a:
                continue
            else:
                pre = a
                result += 1
        return result