题目原文:
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.
题目大意:
判断一个整形数组里面是否含有重复(duplicate)的数字.
题目分析:
利用HashSet中集合的唯一性。若集合中存在的元素再次被add,则添加失败。此时返回true。
源码:(language:java)
public class Solution {
public boolean containsDuplicate(int[] nums) {
HashSet<Integer> set=new HashSet<Integer>();
for(int i:nums) {
if(!set.add(i))
return true;
}
return false;
}
}
成绩:
9ms,beats 61.51%,众数16ms,16.44%