Skip to content

Conversation

ShengyuanWang
Copy link
Member

python3 solution for leetcode 2206 problem

Co-authored-by: Yang Libin <contact@yanglibin.info>
@ShengyuanWang ShengyuanWang requested a review from yanglbme March 24, 2022 06:19
@yanglbme
Copy link
Member

三个文件都要改一下

@yanglbme
Copy link
Member

帮你简化一下写法,更加 Pythonic,同时不影响可读性

class Solution:
    def divideArray(self, nums: List[int]) -> bool:
        cnt = Counter(nums)
        return all(v % 2 == 0 for v in cnt.values())

@yanglbme yanglbme merged commit d421285 into doocs:main Mar 24, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants