leetcode217：Contains Duplicate

最新推荐文章于 2024-03-05 15:58:48 发布

最帅的程序猿

最新推荐文章于 2024-03-05 15:58:48 发布

阅读量242

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u010145043/article/details/50895582

版权

leetcode 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

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.

    public class Solution {
        public boolean containsDuplicate(int[] nums) {
            if(nums==null||nums.length<2) return false;
            HashSet<Integer> set=new HashSet<Integer>();
            for(int i:nums){
                if(!set.add(i)){
                    return true;
                }
            }
            return false;
        }
    }