[leetcode] 217. Contains Duplicate

Q

Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.

Example 1:

Input: nums = [1,2,3,1]
Output: true
Example 2:

Input: nums = [1,2,3,4]
Output: false

A

class Solution(object):
    def containsDuplicate(self, nums):
        """
        :type nums: List[int]
        :rtype: bool
        """
        uni = len(set(nums))
        if len(nums) == uni:
            return False
        else : return True
        

• count elements of set of the list -> if it is different than original list count : duplicate exists.
• could be shortened

def containsDuplicate(self, nums):
	return len(nums)!= len(set(nums))