From b1368cf86de86c86d726801fe82b87019995ca30 Mon Sep 17 00:00:00 2001
From: mpeters <mpeters@infoverity.com>
Date: Fri, 11 Oct 2019 12:32:57 -0400
Subject: [PATCH 1/2] #442 solution

---
 #442/Solution.java | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)
 create mode 100644 #442/Solution.java

diff --git a/#442/Solution.java b/#442/Solution.java
new file mode 100644
index 0000000..d8de9ef
--- /dev/null
+++ b/#442/Solution.java
@@ -0,0 +1,17 @@
+/**
+ * https://leetcode.com/problems/find-all-duplicates-in-an-array/
+ */
+
+class Solution {
+	public List<Integer> findDuplicates(int[] nums) {
+		List<Integer> duplicates = new ArrayList<Integer>();
+		Set<Integer> noDupes = new HashSet<Integer>();
+        for (int i = 0; i < nums.length; i++){
+            boolean isAdded = noDupes.add(nums[i]);
+            if(isAdded == false) {
+            	duplicates.add(nums[i]);
+            }
+        }
+        return duplicates;
+	}
+}

From 06a2de32892375f72defd291b02003dcb42fab03 Mon Sep 17 00:00:00 2001
From: mpeters <mpeters@infoverity.com>
Date: Fri, 11 Oct 2019 12:37:12 -0400
Subject: [PATCH 2/2] #442 solution

---
 #442/Solution.java | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/#442/Solution.java b/#442/Solution.java
index d8de9ef..67bade0 100644
--- a/#442/Solution.java
+++ b/#442/Solution.java
@@ -7,8 +7,7 @@ public List<Integer> findDuplicates(int[] nums) {
 		List<Integer> duplicates = new ArrayList<Integer>();
 		Set<Integer> noDupes = new HashSet<Integer>();
         for (int i = 0; i < nums.length; i++){
-            boolean isAdded = noDupes.add(nums[i]);
-            if(isAdded == false) {
+            if(noDupes.add(nums[i]) == false) {
             	duplicates.add(nums[i]);
             }
         }