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*/
        public boolean isRectangleOverlap(int[] rec1, int[] rec2) {
            return rec1[0] < rec2[2] && rec2[0] < rec1[2] && rec1[1] < rec2[3] && rec2[1] < rec1[3];
        }
    }
}

@@ -33,749 +33,8 @@
 s;%0A%0A
-/**%0A * 836. Rectangle Overlap%0A *%0A * A rectangle is represented as a list %5Bx1, y1, x2, y2%5D, where (x1, y1) are the coordinates of%0A * its bottom-left corner, and (x2, y2) are the coordinates of its top-right corner.%0A * Two rectangles overlap if the area of their intersection is positive.%0A * To be clear, two rectangles that only touch at the corner or edges do not overlap.%0A * Given two (axis-aligned) rectangles, return whether they overlap.%0A *%0A * Example 1:%0A * Input: rec1 = %5B0,0,2,2%5D, rec2 = %5B1,1,3,3%5D%0A * Output: true%0A *%0A * Example 2:%0A * Input: rec1 = %5B0,0,1,1%5D, rec2 = %5B1,0,2,1%5D%0A * Output: false%0A *%0A * Notes:%0A * Both rectangles rec1 and rec2 are lists of 4 integers.%0A * All coordinates in rectangles will be between -10%5E9 and 10%5E9.%0A * */%0A
 publ
@@ -96,16 +96,28 @@
      /**
+%0A         * 
 credit: 
@@ -221,16 +221,26 @@
 1D-to-2D
+%0A         
 */%0A     

refactor 836