leetcode (Rectangle Overlap)
阿新 • • 發佈:2019-01-02
Title: Rectangle Overlap 836
Difficulty:Easy
原題leetcode地址: https://leetcode.com/problems/rectangle-overlap/
1. 見程式碼註釋
時間複雜度:O(1)。
空間複雜度:O(1)。
/** * 相交部分 * @param rec1 * @param rec2 * @return */ public static boolean isRectangleOverlap(int[] rec1, int[] rec2) { int tempmaxx = Math.max(rec1[0], rec2[0]); int tempminx = Math.min(rec1[2], rec2[2]); int tempmaxy = Math.max(rec1[1], rec2[1]); int tempminy = Math.min(rec1[3], rec2[3]); System.out.println(Math.max(-10, 5)); return (tempminx > tempmaxx) && (tempminy > tempmaxy); }