Leetcode/src/main/java/com/fishercoder/solutions/_217.java at master · springcloudservice/Leetcode

Repository navigation

package com.fishercoder.solutions;

import java.util.HashSet;

import java.util.Set;

/**

* 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 _217 {

public static class Solution1 {

public boolean containsDuplicate(int[] nums) {

if (nums == null || nums.length == 0) {

return false;

}

Set<Integer> set = new HashSet();

for (int i : nums) {

if (!set.add(i)) {

return true;

}

return false;

}