최근 포스트

[LeetCode] 507. Perfect Number

최대 1 분 소요

Python class Solution: def detectCapitalUse(self, word: str) -> bool: if word.upper() == word or word.lower() == word: return True...

[LeetCode] 507. Perfect Number

최대 1 분 소요

Python class Solution: def checkPerfectNumber(self, num: int) -> bool: if num < 2: return False answer = 1 for ...

[LeetCode] 219. Contains Duplicate II

최대 1 분 소요

Python class Solution: def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: if len(nums) == len(set(nums)): return ...