leetcode 腾讯精选练习（50 题）217.存在重复元素

原题目

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

思路

边界条件：nums == None

判断原数组和取 set 后的数组长度是否相等，相等则没有重复元素，不相等则有重复元素

第一遍解法

# Runtime: 40 ms, faster than 93.18% of Python3
# Memory Usage: 18.9 MB, less than 48.53% of Python3
class Solution:
    def containsDuplicate(self, nums):
        if nums == None:
            return false
        return len(nums) != len(set(nums))

网上好的解法

自己可以改进的地方

最简代码

获得的思考