0217 - Contains Duplicates
Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.
Examples
Input: nums = [1,2,3,1] Output: true
Input: nums = [1,2,3,4] Output: false
Input: nums = [1,1,1,3,3,4,3,2,4,2] Output: true
Constraints
1 <= nums.length <= 105 -109 <= nums[i] <= 109
Java Solution
class Solution {
public boolean containsDuplicate(int[] nums) {
Set<Integer> hs = new HashSet();
for(int i = 0; i < nums.length; i++) {
if(hs.contains(nums[i])) return true;
else hs.add(nums[i]);
}
return false;
}
}
Last updated