refactor 356

fishercoder1534 · fishercoder1534 · commit ab37f41c4d92 · 2020-06-10T11:52:44.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_356.java b/src/main/java/com/fishercoder/solutions/_356.java
@@ -3,29 +3,11 @@
 import java.util.HashSet;
 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:
- Given points = [[1,1],[-1,1]], return true.
-
- Example 2:
- Given points = [[1,1],[-1,-1]], return false.
-
- Follow up:
- Could you do better than O(n2)?
-
- Hint:
-
- Find the smallest and largest x-value for all points.
- If there is a line then it should be at y = (minX + maxX) / 2.
- For each point, make sure that it has a reflected point in the opposite side.
- */
 public class _356 {
     public static class Solution1 {
-        /** credit: https://discuss.leetcode.com/topic/48172/simple-java-hashset-solution */
+        /**
+         * 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;
