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.
查找整数组是否含有重复元素,可以用map或set实现。利用map的containsKey()来判断是否存在,利用set的add()元素不允许重复
public class Solution {
public boolean containsDuplicate(int[] nums) {
Map<Integer, Integer> map = new HashMap<Integer, Integer>();
for (int i = 0; i < nums.length; i++) {
if (map.containsKey(nums[i])) {
return true;
}else {
map.put(nums[i], i);
}
}
return false;
}
}