Skip to content

Latest commit

 

History

History
24 lines (19 loc) · 540 Bytes

File metadata and controls

24 lines (19 loc) · 540 Bytes

217. Contains Duplicate

Problem

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. tag:

  • hash table

Solution

java

    public boolean containsDuplicate(int[] nums) {
        Set<Integer> hashSet = new HashSet<Integer>();
        for(int num: nums) {
            if(!hashSet.add(num)) return true;
        }
        return false;
    }

go