Tags: "leetcode", "duplicate", access_time 1-min read

Edit this post on Github

Contains Duplicate

Created: September 10, 2018 by [lek-tin]

Last updated: September 10, 2018

Given an array of integers, find if the array contains any duplicates.

Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.

Example 1:

Input: [1,2,3,1]
Output: true

Example 2:

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

Example 3:

Input: [1,1,1,3,3,4,3,2,4,2]
Output: true

Solution

class Solution:
    def containsDuplicate(self, nums):
        """
        :type nums: List[int]
        :rtype: bool
        """
        sortedNums = sorted(nums)
        for i in range(1, len(nums)):
            if sortedNums[i] == sortedNums[i-1]:
                return True
        return False