首页 > itarticle > algorithm notes: leetcode#217 contains duplicate

algorithm notes: leetcode#217 contains duplicate

admin 11月 12, 2020 0

Problem

Solution

Analysis

Python implementation

class :
    def containsDuplicate(self, nums):
        """
        :type nums: List[int]
        :rtype: bool
        """
        nums_set = set()
        for num in nums:
            if num in nums_set:
                return True
            nums_set.add(num)
        return False

class (object):
    def containsDuplicate(self, nums):
        """
        :type nums: List[int]
        :rtype: bool
        """
        return len(nums) > len(set(nums))

Java implementation

class  {
    public boolean containsDuplicate(int[] nums) {
        Set<Integer> numsSet = new HashSet<>();
        for(int num : nums){
            if(numsSet.contains(num)){
                return true;
            }
            numsSet.add(num);
        }
        return false;
    }
}

Time complexity

O(n).

Space complexity

O(n).

Link

217. Contains Duplicate
(中文版) 算法笔记: 力扣#217 存在重复元素