217. Contains Duplicate
来源:互联网 发布:sarah brightman 知乎 编辑:程序博客网 时间:2024/06/06 19:13
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.
class Solution(object):
def containsDuplicate(self, nums):
"""
:type nums: List[int]
:rtype: bool
"""
letters={}
for i in nums:
letters[i]=letters.get(i,0)+1;
for k,v in letters.items():
if letters[k]>1:
return True
return False
0 0
- 217. Contains Duplicate
- LeetCode 217. Contains Duplicate
- [leetcode] 217.Contains Duplicate
- 217.Contains Duplicate
- 【leetcode】217. Contains Duplicate
- 【Leetcode】217. Contains Duplicate
- [LeetCode]217. Contains Duplicate
- 217. Contains Duplicate LeetCode
- 217. Contains Duplicate
- LeetCode 217. Contains Duplicate
- 217. Contains Duplicate
- 217. Contains Duplicate
- 217. Contains Duplicate
- [LeetCode]217. Contains Duplicate
- 【LeetCode】217. Contains Duplicate
- 217. Contains Duplicate
- 217. Contains Duplicate
- leetcode 217. Contains Duplicate
- bzoj2154 Crash的数字表格
- linux基础
- gulp安装步骤
- JVM加载类过程的总结
- C++模板实现二叉查找树(一 树的数据结构定义与节点插入)
- 217. Contains Duplicate
- Java多线程编程
- 蓝桥杯-第n个素数
- AlloyClip的简单使用
- 2017广东工业大学程序设计竞赛决赛 网络赛
- 多态的用法①
- http-server使用教程 hs -o
- android 颜色搭配表
- mvn仓库地址及mirror镜像网址