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
思路:用hashset.add自动去重复,然后最后比较size和num.length,如果相等,证明没有重复,如果不等,证明有重复;
class Solution {
public boolean containsDuplicate(int[] nums) {
if(nums == null || nums.length == 1) return false;
HashSet<Integer> hashset = new HashSet<Integer>();
for(int i=0; i<nums.length; i++) {
hashset.add(nums[i]);
}
return (hashset.size() == nums.length) ? false : true;
}
}