refactor 391

Author: fishercoder1534

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

@@ -3,61 +3,11 @@
 import java.util.HashSet;
 import java.util.Set;
 
-/**
- * 391. Perfect Rectangle
- *
- * Given N axis-aligned rectangles where N > 0, determine if they all together form an exact cover of a rectangular region.
- Each rectangle is represented as a bottom-left point and a top-right point.
- For example, a unit square is represented as [1,1,2,2]. (coordinate of bottom-left point is (1, 1) and top-right point is (2, 2)).
-
- Example 1:
-
- rectangles = [
- [1,1,3,3],
- [3,1,4,2],
- [3,2,4,4],
- [1,3,2,4],
- [2,3,3,4]
- ]
-
- Return true. All 5 rectangles together form an exact cover of a rectangular region.
-
- Example 2:
-
- rectangles = [
- [1,1,2,3],
- [1,3,2,4],
- [3,1,4,2],
- [3,2,4,4]
- ]
-
- Return false. Because there is a gap between the two rectangular regions.
-
- Example 3:
-
- rectangles = [
- [1,1,3,3],
- [3,1,4,2],
- [1,3,2,4],
- [3,2,4,4]
- ]
-
- Return false. Because there is a gap in the top center.
-
- Example 4:
-
- rectangles = [
- [1,1,3,3],
- [3,1,4,2],
- [1,3,2,4],
- [2,2,4,4]
- ]
-
- Return false. Because two of the rectangles overlap with each other.
- */
 public class _391 {
     public static class Solution1 {
-        /** credit: https://discuss.leetcode.com/topic/56052/really-easy-understanding-solution-o-n-java */
+        /**
+         * credit: https://discuss.leetcode.com/topic/56052/really-easy-understanding-solution-o-n-java
+         */
         public boolean isRectangleCover(int[][] rectangles) {
             if (rectangles.length == 0 || rectangles[0].length == 0) {
                 return false;
@@ -99,7 +49,7 @@ public boolean isRectangleCover(int[][] rectangles) {
             }
 
             if (!set.contains(x1 + " " + y1) || !set.contains(x1 + " " + y2) || !set.contains(
-                x2 + " " + y1) || !set.contains(x2 + " " + y2) || set.size() != 4) {
+                    x2 + " " + y1) || !set.contains(x2 + " " + y2) || set.size() != 4) {
                 return false;
             }