refactor 1228

fishercoder1534 · fishercoder1534 · commit 118c08029d66 · 2020-08-12T12:02:06.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1228.java b/src/main/java/com/fishercoder/solutions/_1228.java
@@ -6,30 +6,11 @@
 import java.util.List;
 import java.util.Map;
 
-/**
- * 1228. Missing Number In Arithmetic Progression
- *
- * In some array arr, the values were in arithmetic progression: the values arr[i+1] - arr[i] are all equal for every 0 <= i < arr.length - 1.
- * Then, a value from arr was removed that was not the first or last value in the array.
- * Return the removed value.
- *
- * Example 1:
- * Input: arr = [5,7,11,13]
- * Output: 9
- * Explanation: The previous array was [5,7,9,11,13].
- *
- * Example 2:
- * Input: arr = [15,13,12]
- * Output: 14
- * Explanation: The previous array was [15,14,13,12].
- *
- * Constraints:
- * 3 <= arr.length <= 1000
- * 0 <= arr[i] <= 10^5
- * */
 public class _1228 {
     public static class Solution1 {
-        /**A super verbose and inefficient but working way...*/
+        /**
+         * A super verbose and inefficient but working way...
+         */
         public int missingNumber(int[] arr) {
             Arrays.sort(arr);
             Map<Integer, List<Integer>> map = new HashMap<>();
@@ -50,7 +31,9 @@ public int missingNumber(int[] arr) {
     }
 
     public static class Solution2 {
-        /**credit: https://leetcode.com/problems/missing-number-in-arithmetic-progression/discuss/408474/JavaC%2B%2BPython-Arithmetic-Sum-and-Binary-Search*/
+        /**
+         * credit: https://leetcode.com/problems/missing-number-in-arithmetic-progression/discuss/408474/JavaC%2B%2BPython-Arithmetic-Sum-and-Binary-Search
+         */
         public int missingNumber(int[] arr) {
             int min = arr[0];
             int max = arr[0];
