-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathContDup.java
More file actions
68 lines (44 loc) · 1.26 KB
/
ContDup.java
File metadata and controls
68 lines (44 loc) · 1.26 KB
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
import java.util.*;
class ContDup {
public static boolean containsDuplicate(int[] nums) {
// Create set; if size of set = size of nums, no dups
HashSet <Integer> set = new HashSet<>();
for (int num : nums) {
set.add(num);
}
if (nums.length == set.size()) return false;
return true;
// HashSet <Integer> mySet = new HashSet<>();
// for (int num : nums) {
// mySet.add(num);
// }
// if (mySet.size() == nums.length) {
// return false;
// }
// return true;
}
public static void main(String[] args) {
int[] nums = {1,2,3,1};
System.out.println(containsDuplicate(nums));
}
}
/*
Make a set of the numbers; if the set size = array size, no dups
https://leetcode.com/problems/contains-duplicate/description/
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
Explanation:
The element 1 occurs at the indices 0 and 3.
Example 2:
Input: nums = [1,2,3,4]
Output: false
Explanation:
All elements are distinct.
Example 3:
Input: nums = [1,1,1,3,3,4,3,2,4,2]
Output: true
*/