JAVA_Rectangle Overlap_LeetCode 836

JAVA_Rectangle Overlap_LeetCode 836 풀이 class Solution { public boolean isRectangleOverlap(int[] rec1, int[] rec2) { return (rec1[0] < rec2[2] && rec1[1] < rec2[3] && rec1[2] > rec2[0] && rec1[3] > rec2[1]); } } 사각형 겹침 조건 rec1(x2, y2) > rec2(x1, y1) rec1(x1, y1) < rec2(x2, y2) * 출처 Rectangle Overlap - LeetCode Can you solve this real interview question? Rectangle Overlap - An axis-aligned rectangle is represented as a list [x1, y1, x2, y2], where (x1, y1) is the coordinate of its bottom-left corn...

원문링크 : JAVA_Rectangle Overlap_LeetCode 836