refactor 446

Author: fishercoder1534

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

@@ -44,28 +44,32 @@ A subsequence slice (P0, P1, ..., Pk) of array A is called arithmetic if the seq
  [2,6,10]
  */
 public class _446 {
-    /**reference: https://discuss.leetcode.com/topic/67413/detailed-explanation-for-java-o-n-2-solution*/
-    public int numberOfArithmeticSlices(int[] A) {
-        int res = 0;
-        Map<Integer, Integer>[] map = new Map[A.length];
-
-        for (int i = 0; i < A.length; i++) {
-            map[i] = new HashMap<>(i);
-
-            for (int j = 0; j < i; j++) {
-                long diff = (long) A[i] - A[j];
-                if (diff <= Integer.MIN_VALUE || diff > Integer.MAX_VALUE) {
-                    continue;
+    public static class Solution1 {
+        /**
+         * reference: https://discuss.leetcode.com/topic/67413/detailed-explanation-for-java-o-n-2-solution
+         */
+        public int numberOfArithmeticSlices(int[] A) {
+            int res = 0;
+            Map<Integer, Integer>[] map = new Map[A.length];
+
+            for (int i = 0; i < A.length; i++) {
+                map[i] = new HashMap<>(i);
+
+                for (int j = 0; j < i; j++) {
+                    long diff = (long) A[i] - A[j];
+                    if (diff <= Integer.MIN_VALUE || diff > Integer.MAX_VALUE) {
+                        continue;
+                    }
+
+                    int d = (int) diff;
+                    int c1 = map[i].getOrDefault(d, 0);
+                    int c2 = map[j].getOrDefault(d, 0);
+                    res += c2;
+                    map[i].put(d, c1 + c2 + 1);
                 }
-
-                int d = (int) diff;
-                int c1 = map[i].getOrDefault(d, 0);
-                int c2 = map[j].getOrDefault(d, 0);
-                res += c2;
-                map[i].put(d, c1 + c2 + 1);
             }
-        }
 
-        return res;
+            return res;
+        }
     }
 }