FilesExpand file tree

 master

/

ContainsDuplicate217.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

29 lines (25 loc) · 780 Bytes

 master

/

ContainsDuplicate217.java

Copy path

Top

File metadata and controls

• Code
• Blame

29 lines (25 loc) · 780 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

/**

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

public boolean containsDuplicate(int[] nums) {

Set<Integer> set = new HashSet<>();

for (int n: nums) {

if (set.contains(n)) {

return true;

} else {

set.add(n);

}

}

return false;

}

public boolean containsDuplicate2(int[] nums) {

Arrays.sort(nums);

for (int i = 0; i < nums.length - 1; ++i) {

if (nums[i] == nums[i + 1]) return true;

}

return false;

}

}