Leetcode 575. Distribute Candies

Tyan

发布于 2022-08-11 15:03:34

1770

发布于 2022-08-11 15:03:34

文章被收录于专栏：SnailTyanSnailTyan

文章作者：Tyan 博客：noahsnail.com | CSDN | 简书

1. Description

2. Solution

**解析：**Version 1，使用dict。

Version 1

class Solution:
    def distributeCandies(self, candyType: List[int]) -> int:
        candies = {}
        for candy in candyType:
            candies[candy]  = candies.get(candy, 0) + 1
        return min(len(candies), len(candyType) // 2)
        # return min(len(Counter(candyType)), len(candyType) // 2)

**解析：**Version 2，使用set。

Version 2

class Solution:
    def distributeCandies(self, candyType: List[int]) -> int:
        candies = set()
        for candy in candyType:
            candies.add(candy)
        return min(len(candies), len(candyType) // 2)
        # return min(len(set(candyType)), len(candyType) // 2)