refactor 356

fishercoder1534 · fishercoder1534 · commit 1feac43a0db1 · 2019-01-25T08:18:03.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_356.java b/src/main/java/com/fishercoder/solutions/_356.java
@@ -4,6 +4,8 @@
 import java.util.Set;
 
 /**
+ * 356. Line Reflection
+ *
  * Given n points on a 2D plane, find if there is such a line parallel to y-axis that reflect the given points.
 
  Example 1:
@@ -22,24 +24,26 @@ Could you do better than O(n2)?
  For each point, make sure that it has a reflected point in the opposite side.
  */
 public class _356 {
-    /**credit: https://discuss.leetcode.com/topic/48172/simple-java-hashset-solution*/
-    public boolean isReflected(int[][] points) {
-        int max = Integer.MIN_VALUE;
-        int min = Integer.MAX_VALUE;
-        Set<String> set = new HashSet<>();
-        for (int[] point : points) {
-            max = Math.max(max, point[0]);
-            min = Math.min(min, point[0]);
-            String str = point[0] + "a" + point[1];
-            set.add(str);
-        }
-        int sum = max + min;
-        for (int[] p : points) {
-            String str = (sum - p[0]) + "a" + p[1];
-            if (!set.contains(str)) {
-                return false;
+    public static class Solution1 {
+        /** credit: https://discuss.leetcode.com/topic/48172/simple-java-hashset-solution */
+        public boolean isReflected(int[][] points) {
+            int max = Integer.MIN_VALUE;
+            int min = Integer.MAX_VALUE;
+            Set<String> set = new HashSet<>();
+            for (int[] point : points) {
+                max = Math.max(max, point[0]);
+                min = Math.min(min, point[0]);
+                String str = point[0] + "a" + point[1];
+                set.add(str);
+            }
+            int sum = max + min;
+            for (int[] p : points) {
+                String str = (sum - p[0]) + "a" + p[1];
+                if (!set.contains(str)) {
+                    return false;
+                }
             }
+            return true;
         }
-        return true;
     }
 }
diff --git a/src/test/java/com/fishercoder/_356Test.java b/src/test/java/com/fishercoder/_356Test.java
@@ -6,33 +6,30 @@
 
 import static org.junit.Assert.assertEquals;
 
-/**
- * Created by stevesun on 6/1/17.
- */
 public class _356Test {
-    private static _356 test;
-    private static int[][] points;
+  private static _356.Solution1 solution1;
+  private static int[][] points;
 
-    @BeforeClass
-    public static void setup() {
-        test = new _356();
-    }
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _356.Solution1();
+  }
 
-    @Test
-    public void test1() {
-        points = new int[][]{
-                {1, 1},
-                {-1, 1},
-        };
-        assertEquals(true, test.isReflected(points));
-    }
+  @Test
+  public void test1() {
+    points = new int[][] {
+        {1, 1},
+        {-1, 1},
+    };
+    assertEquals(true, solution1.isReflected(points));
+  }
 
-    @Test
-    public void test2() {
-        points = new int[][]{
-                {1, 1},
-                {-1, -1},
-        };
-        assertEquals(false, test.isReflected(points));
-    }
+  @Test
+  public void test2() {
+    points = new int[][] {
+        {1, 1},
+        {-1, -1},
+    };
+    assertEquals(false, solution1.isReflected(points));
+  }
 }
