LeetCode:Contains Duplicate
2016-05-28 12:27
483 查看
Contains Duplicate
Total Accepted: 92048 TotalSubmissions: 221101 Difficulty: Easy
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.
Subscribe to see which companies asked this question
Hide Tags
Array Hash
Table
Hide Similar Problems
(E) Contains Duplicate II (M)
Contains Duplicate III
java code:
public class Solution { public boolean containsDuplicate(int[] nums) { Set<Integer> set = new HashSet<Integer>(); for(int num:nums) { if(!set.add(num)) return true; } return false; } }
c++ code:
class Solution { public: bool containsDuplicate(vector<int>& nums) { return set<int>(nums.begin(),nums.end()).size() < nums.size(); } };
相关文章推荐
- 你真的会用email?
- Codeforces Round #317 [AimFund Thanks-Round] (Div. 2) C Lengthening Sticks(组合+容斥)
- Check failed: error == cudaSuccess (8 vs. 0) invalid device function
- 【HDU】 1239 Calling Extraterrestrial Intelligence Again
- Main函数中的argc和argv说明
- saiku
- 发展人工智能,中国先于美国一步有何证据?
- Failed to load the JNI shared library jvm.dll
- POJ 1273 Drainage Ditches题解——S.B.S.
- 我国发展人工智能三年行动实施方案的理论基础
- 2015 Multi-University Training Contest 1 题集(长期更新)A B E
- gradle project refresh failed: protocol family unavailable
- UltraISOPE 9.6简体中文|单文件版|软碟通
- 软碟通+Ultraiso制作u盘启动盘
- 渗透测试工具实战技巧合集 xiaix 2016-05-27 共32572人围观,发现13个不明物体
- 用UltraIso便捷版制作万能隐藏启动U盘
- Codeforces Round #317 [AimFund Thanks-Round] (Div. 2) B Order Book
- poj 1411 Calling Extraterrestrial Intelligence Again(超时)
- Codeforces Round #353 (Div. 2) E. Trains and Statistic 线段树+dp
- Codeforces Round #317 [AimFund Thanks-Round] (Div. 2)A Arrays