Leetcode no. 217

来源:互联网 发布:我的世界起床战争端口 编辑:程序博客网 时间:2024/05/16 10:41

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.


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


0 0