217. Contains Duplicate

217. Contains Duplicate

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

解法1 HashMap

用hashmap，键是原数组的元素，值是出现的次数
存完以后判断出现次数是否大于1，若有大于1的出现就是有重复的

class Solution {
    public boolean containsDuplicate(int[] nums) {
    HashMap<Integer,Integer> map = new HashMap();
    for(int i=0;i<nums.length;i++)
    {
        
     if(!map.containsKey(nums[i])){
         map.put(nums[i],1);
     }   
    else{
        int value=map.get(nums[i]);
        value++;
        map.put(nums[i],value);
    }
    }
    for(Integer key:map.keySet()){
        Integer value = map.get(key);
        if(value>1)
            return true;
    }
    return false;
}

}

解法2 Set

其实以上解法思路可以简化为只用set集合的contains方法，先判断一旦包含过就是有重复的，然后将该元素添加进集合

class Solution {
    public boolean containsDuplicate(int[] nums) {
    Set<Integer> set = new HashSet<>();
        for(int x:nums){
            if(set.contains(x))
            {
                return true;
            }
            set.add(x);
        }
        return false;
}

}