Leetcode + Contains Duplicate"/>
Leetcode + Contains Duplicate
Leetcode + Contains Duplicate
题目描述
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
来源:力扣(LeetCode)
链接:
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
思路解析
class Solution:def containsDuplicate(self, nums: List[int]) -> bool:visited = set()for num in nums:if num in visited:return Truevisited.add(num)return False
更多推荐
Leetcode + Contains Duplicate
发布评论