#836 矩形重叠

Author: Isaaclot

main/src/math/LC_836_RectangleOverlap.java

@@ -0,0 +1,17 @@
+package math;
+
+/**
+ * @author liangqian0723@gmail.com
+ * @since 2020/3/18 3:16 PM
+ */
+public class LC_836_RectangleOverlap {
+    /**
+     * 思路：rec1左下角的坐标都比rec2右上角大，rec1右上角的坐标都比rec2左下角大，
+     */
+    public boolean isRectangleOverlap(int[] rec1, int[] rec2) {
+        return rec1[2] > rec2[0] &&   // left
+                rec1[3] > rec2[1] &&   // bottom
+                rec1[0] < rec2[2] &&   // right
+                rec1[1] < rec2[3];    // top
+    }
+}

main/test/math/LC_836_RectangleOverlapTest.java

@@ -0,0 +1,30 @@
+package math;
+
+import org.junit.Test;
+
+import static org.hamcrest.core.Is.is;
+import static org.junit.Assert.assertThat;
+
+/**
+ * @author liangqian0723@gmail.com
+ * @since 2020/3/18 3:15 PM
+ */
+public class LC_836_RectangleOverlapTest {
+    @Test
+    public void test_is_over_lap() {
+        LC_836_RectangleOverlap rl = new LC_836_RectangleOverlap();
+        assertThat(rl.isRectangleOverlap(new int[]{0, 0, 2, 2}, new int[]{1, 1, 3, 3}), is(true));
+    }
+
+    @Test
+    public void test_is_over_lap_case2() {
+        LC_836_RectangleOverlap rl = new LC_836_RectangleOverlap();
+        assertThat(rl.isRectangleOverlap(new int[]{0, 0, 1, 1}, new int[]{1, 0, 2, 1}), is(false));
+    }
+
+    @Test
+    public void test_is_over_lap_case3() {
+        LC_836_RectangleOverlap rl = new LC_836_RectangleOverlap();
+        assertThat(rl.isRectangleOverlap(new int[]{5, 15, 8, 18}, new int[]{0, 3, 7, 9}), is(false));
+    }
+}