[Leet Code] 217. Con tains Duplicate

Code 1) Not Used Set

class Solution:
    def containsDuplicate(self, nums: List[int]) -> bool:
        for i in range(len(nums)):
            for j in range(i+1, len(nums)):
                if nums[i] == nums[j]:
                    return True
        return False
        
    # Time Complexity : O(n^2)
    # Space Complexity : O(1)

 

Code 2) Used Set

class Solution:
    def containsDuplicate(self, nums: List[int]) -> bool:
        return len(nums) != len(set(nums))
    # Time Complexity : O(1)
    # Space Complexity : O(1)