refactor 836

fishercoder1534 · fishercoder1534 · commit cceb094f082b · 2020-07-24T09:42:21.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_836.java b/src/main/java/com/fishercoder/solutions/_836.java
@@ -1,29 +1,10 @@
 package com.fishercoder.solutions;
 
-/**
- * 836. Rectangle Overlap
- *
- * A rectangle is represented as a list [x1, y1, x2, y2], where (x1, y1) are the coordinates of
- * its bottom-left corner, and (x2, y2) are the coordinates of its top-right corner.
- * Two rectangles overlap if the area of their intersection is positive.
- * To be clear, two rectangles that only touch at the corner or edges do not overlap.
- * Given two (axis-aligned) rectangles, return whether they overlap.
- *
- * Example 1:
- * Input: rec1 = [0,0,2,2], rec2 = [1,1,3,3]
- * Output: true
- *
- * Example 2:
- * Input: rec1 = [0,0,1,1], rec2 = [1,0,2,1]
- * Output: false
- *
- * Notes:
- * Both rectangles rec1 and rec2 are lists of 4 integers.
- * All coordinates in rectangles will be between -10^9 and 10^9.
- * */
 public class _836 {
     public static class Solution1 {
-        /**credit: https://leetcode.com/problems/rectangle-overlap/discuss/132340/C%2B%2BJavaPython-1-line-Solution-1D-to-2D*/
+        /**
+         * credit: https://leetcode.com/problems/rectangle-overlap/discuss/132340/C%2B%2BJavaPython-1-line-Solution-1D-to-2D
+         */
         public boolean isRectangleOverlap(int[] rec1, int[] rec2) {
             return rec1[0] < rec2[2] && rec2[0] < rec1[2] && rec1[1] < rec2[3] && rec2[1] < rec1[3];
         }
