def contains_duplicate(nums):
return len(nums)!=len(set(nums))
public boolean containsDuplicate(int[] nums){
Set<Integer> s=new HashSet<>();
for(int n:nums) if(!s.add(n)) return true;
return false;
}
Python's set one-liner. Java's add() returns false on duplicate.
def contains_duplicate(nums):
return len(nums)!=len(set(nums))
public boolean containsDuplicate(int[] nums){
Set<Integer> s=new HashSet<>();
for(int n:nums) if(!s.add(n)) return true;
return false;
}
1. Convert to set 2. Compare lengths