Problem Description:
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: trueExample 2:
Input: [1,2,3,4] Output: falseExample 3:
Input: [1,1,1,3,3,4,3,2,4,2] Output: true
Analysis:
本题的思路就是使用HashSet的数据结构寻找查看是否又出现重复的元素。代码如下:
Code:
class Solution {
public boolean containsDuplicate(int[] nums) {
Set<Integer> res = new HashSet<>();
for(int temp : nums) {
if(res.contains(temp)) {
return true;
}
res.add(temp);
}
return false;
}
}