LeetCode题解:Contains Duplicate
2015-08-12 11:08
337 查看
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.
题意:给定一个整数数组,判断是否含有重复元素
解决思路:利用Set
代码:
题意:给定一个整数数组,判断是否含有重复元素
解决思路:利用Set
代码:
public boolean containsDuplicate(int[] nums) { Set<Integer> set = new HashSet<Integer>(); for(int i : nums) if(!set.add(i))// if there is same return true; return false; }
相关文章推荐
- Dynamics CRM 开启EmailRouter日志记录
- Dynamics CRM 开启EmailRouter日志记录
- Dynamics CRM 开启EmailRouter日志记录
- Dynamics CRM 开启EmailRouter日志记录
- 再谈应用环境下的TIME_WAIT和CLOSE_WAIT
- 新型程序设计语言:Braise语言!
- HDU 3394 双连通分量 桥 Railway
- Contains Duplicate III
- 解决Failed to allocate memory: 8
- 2015 Multi-University Training Contest 7 hdu 5371 Hotaru's problem
- 如何获取经纬度之间两点间真实距离(适用于GoogleMap,BaiduMap,Amap等)
- 报错:failed to get the task for process XXX(解决方案)
- 一个epoll/aio/eventfd结合使用的简单例子
- 数据挖掘十大算法——Naive Bayes
- Failed to load class "org.slf4j.impl.StaticLoggerBinder问题故障的解决
- HDU 2473 Junk-Mail Filter (并查集的删除操作)
- scala 学习笔记(05) OOP(中)灵活的trait
- 2015 Multi-University Training Contest 7(hdu5371、5372、5373、5375、5378、5379)(dp+概率Manachar+dfs计数+树状数组)
- 2015 Multi-University Training Contest 7 hdu 5372 Segment Game
- hdu 1532 Drainage Ditches 增广路 ford