217. Contains Duplicate
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.
Example 1:
Input: [1,2,3,1]
Output: true
Example 2:
Input: [1,2,3,4]
Output: false
Example 3:
Input: [1,1,1,3,3,4,3,2,4,2]
Output: true
题意
给定一个数组,判断数组中是否有重复元素
思路
哈希表
代码
class Solution {
public boolean containsDuplicate(int[] nums) {
HashMap<Integer, Boolean> map = new HashMap<Integer, Boolean>();
for (int num: nums) {
if (map.containsKey(num)) {
return true;
} else {
map.put(num, true);
}
}
return false;
}
}