refactor 532

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_532.java

@@ -1,13 +1,11 @@
 package com.fishercoder.solutions;
 
-import java.util.Arrays;
 import java.util.HashMap;
-import java.util.HashSet;
-import java.util.List;
 import java.util.Map;
-import java.util.Set;
 
 /**
+ * 532. K-diff Pairs in an Array
+ *
  * Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array.
  * Here a k-diff pair is defined as an integer pair (i, j), where i and j are both numbers in the array and their absolute difference is k.
 
@@ -34,36 +32,29 @@ The pairs (i, j) and (j, i) count as the same pair.
  */
 public class _532 {
 
-    //this O(n^2) will result in TLE
-    public int findPairs_On2(int[] nums, int k) {
-        Set<List<Integer>> pairsSet = new HashSet<>();
-        for (int i = 0; i < nums.length - 1; i++) {
-            for (int j = i + 1; j < nums.length; j++) {
-                if (Math.abs(nums[j] - nums[i]) == k) {
-                    pairsSet.add(nums[i] > nums[j] ? Arrays.asList(nums[j], nums[i]) : Arrays.asList(nums[i], nums[j]));
-                }
-            }
-        }
-        return pairsSet.size();
-    }
-
     public int findPairs(int[] nums, int k) {
-        if (nums == null || nums.length == 0 || k < 0) return 0;
+        if (nums == null || nums.length == 0 || k < 0) {
+            return 0;
+        }
 
         Map<Integer, Integer> map = new HashMap();
-        for (int i : nums) {
-            map.put(i, map.getOrDefault(i, 0) + 1);
+        for (int num : nums) {
+            map.put(num, map.getOrDefault(num, 0) + 1);
         }
 
         int answer = 0;
         for (int key : map.keySet()) {
             if (k == 0) {
-                if (map.get(key) >= 2) answer++;
+                if (map.get(key) >= 2) {
+                    answer++;
+                }
             } else {
-                if (map.containsKey(key + k)) answer++;
+                if (map.containsKey(key + k)) {
+                    answer++;
+                }
             }
         }
         return answer;
     }
 
-}
+}

src/test/java/com/fishercoder/_532Test.java

@@ -5,6 +5,10 @@
 import org.junit.BeforeClass;
 import org.junit.Test;
 
+import java.io.IOException;
+import java.io.InputStream;
+import java.util.Properties;
+
 import static junit.framework.Assert.assertEquals;
 
 public class _532Test {
@@ -15,8 +19,11 @@ public class _532Test {
     private static int[] nums;
 
     @BeforeClass
-    public static void setup() {
+    public static void setup() throws IOException {
         test = new _532();
+        Properties properties = new Properties();
+        InputStream inputStream = _532.class.getClassLoader().getResourceAsStream("fishercoder.properties");
+        properties.load(inputStream);
     }
 
     @Before
@@ -55,8 +62,8 @@ public void test3() {
     }
 
 //    This test case will throw TLE error if your algorithm is O(n^2)
-//    And it doesn't compile in IntelliJ, so I'll ignore it for build
-//    @Ignore("Ignored")
+//    And it doesn't compile in IntelliJ, it throws "java: code too large" error
+//    so I'll comment it out for build
 //    @Test
 //    public void test4() {
 //        k = -139;

src/test/resources/fishercoder.properties

@@ -0,0 +1,3 @@
+size = 100M 
+#this didn't work out as expected to make _532.test4 to compile per this post:
+#https://stackoverflow.com/questions/2407912/code-too-large-compilation-error-in-java