package leetcode;

/**
 * https://leetcode.com/problems/rectangle-overlap/
 */
public class Problem836 {
    public boolean isRectangleOverlap(int[] rec1, int[] rec2) {
        // TODO
        return false;
    }

    public static void main(String[] args) {
        Problem836 prob = new Problem836();
    }
}

@@ -174,24 +174,132 @@
     
-// TODO%0A
+return (rec1%5B0%5D %3C rec2%5B0%5D && rec2%5B0%5D %3C rec1%5B2%5D %7C%7C%0A                rec1%5B0%5D %3C rec2%5B2%5D && rec2%5B2%5D %3C rec1%5B2%5D) &&%0A       
         
 retu
@@ -298,20 +298,106 @@
     
+(
 re
-turn false
+c1%5B1%5D %3C rec2%5B1%5D && rec2%5B1%5D %3C rec2%5B3%5D %7C%7C%0A                rec1%5B1%5D %3C rec2%5B3%5D && rec2%5B3%5D %3C rec2%5B3%5D)
 ;%0A  
@@ -490,16 +490,559 @@
 m836();%0A
+        System.out.println(prob.isRectangleOverlap(new int%5B%5D%7B0, 0, 2, 2%7D, new int%5B%5D%7B1, 1, 3, 3%7D)); // true%0A        System.out.println(prob.isRectangleOverlap(new int%5B%5D%7B0, 0, 1, 1%7D, new int%5B%5D%7B1, 0, 2, 1%7D)); // false%0A        System.out.println(prob.isRectangleOverlap(new int%5B%5D%7B0, 0, 1, 1%7D, new int%5B%5D%7B0, 0, 2, 1%7D)); // false%0A        System.out.println(prob.isRectangleOverlap(new int%5B%5D%7B0, 0, 2, 2%7D, new int%5B%5D%7B0, 1, 1, 1%7D)); // false%0A        System.out.println(prob.isRectangleOverlap(new int%5B%5D%7B7, 8, 13, 15%7D, new int%5B%5D%7B10, 8, 12, 20%7D)); // true%0A
     %7D%0A%7D%0A

Update problem 836