217. Contains Duplicate (Easy)
来源:互联网 发布:ps pc版和mac版差别 编辑:程序博客网 时间:2024/06/15 05:15
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.
Solution:
Java:
import java.util.HashMap;import java.util.Map;public class Solution { public static boolean containsDuplicate(int[] nums) { Map<Integer, Integer> map = new HashMap<>(); for(int i = 0; i < nums.length; i++) { if(map.get(nums[i]) == null) { map.put(nums[i], i); } else { return true; } } return false; } public static void main(String[] args) { int[] arr = {1, 1, 3, 5, 6}; System.out.println(containsDuplicate(arr)); }}
使用HashMap存储[值,下标],如果发现值对应的下标已存在,则表示该值重复出现在数组中。
0 0
- 217. Contains Duplicate #Easy
- 217. Contains Duplicate (Easy)
- 217. Contains Duplicate [easy] (Python)
- 217. Contains Duplicate 难度:easy
- Easy-题目10:217. Contains Duplicate
- Leetcode 217. Contains Duplicate (Easy) (cpp)
- [Leetcode 217, Easy] Contains Duplicate
- Easy 217题 Contains Duplicate
- leetcode219[easy]----Contains Duplicate II
- Leet Code OJ 217. Contains Duplicate [Difficulty: Easy]
- 217.leetcode Contains Duplicate(easy)[数组 查重]
- [Leetcode 219, Easy] Contains Duplicate II
- Easy-题目41:219. Contains Duplicate II
- 219. Contains Duplicate II [easy] (Python)
- Leetcode 219. Contains Duplicate II (Easy) (cpp)
- Easy 219题 Contains Duplicate II
- 217. Contains Duplicate
- LeetCode 217. Contains Duplicate
- CSS一些样式,间距、链接、滚动条、清除浮动
- 欢(xue)乐(beng)%你赛
- Multiply Strings
- Check rpn proposals in faster-rcnn
- ZStack HTTP API使用
- 217. Contains Duplicate (Easy)
- 自适应宽度盒子水平垂直居中css
- webView中设置cookie无效
- 在 RHEL、CentOS 和 Fedora 上安装 Git 及设置 Git 账号的技巧
- oracle中大数据类型的计算
- HDU 1080 map or trie树
- redis学习--实战1
- bootstrap 汉堡包导航条按钮
- virtualbox设置桥接模式(本地ping虚拟机问题解决)