217. Contains Duplicate
来源:互联网 发布:不知道睡没睡着 知乎 编辑:程序博客网 时间:2024/05/14 05:46
一个数组看有没有一个数字出现两次,用set。
public class Solution {
public boolean containsDuplicate(int[] nums) {
Set<Integer> unique = new HashSet<Integer>();
for(int i=0;i<nums.length;i++) {
if(!unique.contains(nums[i])){
unique.add(nums[i]);
}else 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
- POJ 2195 Going Home(费用流)
- 171. Excel Sheet Column Number
- 栈和队列相关问题
- 手势操作知识大餐 ——iOS
- 【codevs1540】银河英雄传说,以前屯着没做的并查集
- 217. Contains Duplicate
- ARP扫描攻击(JAVA实现)
- CodeForces 158B Taxi
- Linux学习笔记(5)----shell默认的版本bash及变量的设置
- std::lower_bound()和std::upper_bound()总结
- 学习记录 - 3
- poj_3974 Palindrome(最长回文子串)
- View的setTag和getTag方法
- 数据结构之哈希表