L217. 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.

Example 1:

Input: [1,2,3,1]
Output: true

Example 2:

Input: [1,2,3,4]
Output: false

Solution:

• hash table O(n)

public boolean containsDuplicate(int[] nums) {
    if(nums == null || nums.length == 0) return false;
    Set<Integer> set = new HashSet<>();
    for(int n : nums){
        if(set.contains(n)) return true;
        set.add(n);
    }
    return false;
}

• sorting nlogn

public boolean containsDuplicate(int[] nums) {
    Arrays.sort(nums);
    for (int i = 0; i < nums.length - 1; ++i) {
        if (nums[i] == nums[i + 1]) return true;
    }
    return false;
}