edit 532

Author: fishercoder1534

Diff for: README.md

@@ -95,7 +95,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |536|[Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_536.java) | O(n) |O(h) | Medium | Recursion
 |535|[Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_535.java) | O(1) |O(n) | Medium | Design
 |533|[Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_533.java) | O(m*n) |O(m) (m is number of rows) | Medium | HashMap
-|532|[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/KdiffPairsinanArray.java) | O(n) |O(n) | Easy | HashMap
+|532|[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_532.java) | O(n) |O(n) | Easy | HashMap
 |531|[Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_531.java) | O(m*n) |O(1) | Medium | 
 |530|[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MinimumAbsoluteDifferenceinBST.java) | O(n) |O(n) | Easy| DFS
 |529|[Minesweeper](https://leetcode.com/problems/minesweeper/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_529.java) | O(m*n) |O(k) | Medium | BFS

Diff for: src/main/java/com/fishercoder/solutions/KdiffPairsinanArray.java renamed to src/main/java/com/fishercoder/solutions/_532.java

@@ -3,7 +3,8 @@
 import java.util.*;
 
 /**
- * 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.
+ * 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.
 
  Example 1:
  Input: [3, 1, 4, 1, 5], k = 2
@@ -26,7 +27,7 @@ The pairs (i, j) and (j, i) count as the same pair.
  The length of the array won't exceed 10,000.
  All the integers in the given input belong to the range: [-1e7, 1e7].
  */
-public class KdiffPairsinanArray {
+public class _532 {
 
     //this O(n^2) will result in TLE
     public int findPairs_On2(int[] nums, int k) {

Diff for: src/test/java/com/fishercoder/KdiffPairsinanArrayTest.java renamed to src/test/java/com/fishercoder/_532Test.java

@@ -1,22 +1,22 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.KdiffPairsinanArray;
+import com.fishercoder.solutions._532;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static junit.framework.Assert.assertEquals;
 
-public class KdiffPairsinanArrayTest {
-    private static KdiffPairsinanArray test;
+public class _532Test {
+    private static _532 test;
     private static int expected;
     private static int actual;
     private static int k;
     private static int[] nums;
 
     @BeforeClass
     public static void setup() {
-        test = new KdiffPairsinanArray();
+        test = new _532();
     }
 
     @Before