-
Notifications
You must be signed in to change notification settings - Fork 0
/
containsDuplicate.java
50 lines (36 loc) · 1.06 KB
/
containsDuplicate.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Set;
/**
*********************************************************************
217. Contains Duplicate
*********************************************************************
Given an integer array nums, return true if any value appears at least twice in the array,
and return false if every element is distinct.
Example 1:
Input: nums = [1,2,3,1]
Output: true
Example 2:
Input: nums = [1,2,3,4]
Output: false
Example 3:
Input: nums = [1,1,1,3,3,4,3,2,4,2]
Output: true
Constraints:
1 <= nums.length <= 105
-109 <= nums[i] <= 109
*/
public class containsDuplicate {
public static void main(String[] args) {
int[] nums = {1,1,1,3,3,4,3,2,4,2};
boolean result = false;
Set<Integer> numSet = new HashSet<>();
for (int num : nums) {
if (numSet.contains(num)) {
result = true;
}
numSet.add(num);
}
System.out.println("result = " + result); // return result
}
}