GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — leetcode-algorithms/src/RectangleOverlap.java at master · anishLearnsToCode/leetcode-algorithms Expand file tree/ Copy pathRectangleOverlap.javaMore file actions 27 lines (24 loc) · 963 Bytes / Copy pathRectangleOverlap.javaFile metadata and controls27 lines (24 loc) · 963 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 public class RectangleOverlap { public boolean isRectangleOverlap(int[] rec1, int[] rec2) { Rectangle rectangle1 = new Rectangle(rec1); Rectangle rectangle2 = new Rectangle(rec2); return hasXIntersection(rectangle1, rectangle2) && hasYIntersection(rectangle1, rectangle2); } private boolean hasXIntersection(Rectangle rec1, Rectangle rec2) { return (rec1.x1 <= rec2.x1 && rec2.x1 < rec1.x2) || (rec2.x1 < rec1.x1 && rec1.x1 < rec2.x2); } private boolean hasYIntersection(Rectangle rec1, Rectangle rec2) { return (rec1.y1 <= rec2.y1 && rec2.y1 < rec1.y2) || (rec2.y1 < rec1.y1 && rec1.y1 < rec2.y2); } private static class Rectangle { private final int x1, x2, y1, y2; Rectangle(int[] points) { this.x1 = points[0]; this.y1 = points[1]; this.x2 = points[2]; this.y2 = points[3]; } } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |