腾讯五十题 No.39 存在重复元素

题目链接
Set实现

Map实现

class Solution {
    public boolean containsDuplicate(int[] nums) {
        int len = nums.length;
        Map<Integer,Integer> map = new HashMap<>(len);
        for(int i = 0;i<len;i++){
            if(map.containsKey(nums[i])){
                return true;
            }
            map.put(nums[i],i);
        }
        return false;
    }
}

标签：Map,HashMap,nums,int,No.39,len,boolean,腾讯,五十
来源： https://www.cnblogs.com/jianjiana/p/15873525.html