223. Rectangle Area

题目：

Find the total area covered by two rectilinear rectangles in a 2D plane.

Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.

Assume that the total area is never beyond the maximum possible value of int.

链接： http://leetcode.com/problems/rectangle-area/

题解：

数学题，需要判断矩阵是否相交，相交的话减去重复面积(顶点相交除外)。

Time Complexity - O(1)， Space Complexity - O(1)。

public class Solution {public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {int area = (C - A) * (D - B) + (G - E) * (H - F);if(A >= G || B >= H || C <= E || D <= F)return area;int duplicate = (Math.min(C, G) - Math.max(A, E)) * (Math.min(D, H) - Math.max(B, F));return area - duplicate;}
}

二刷:

方法跟一刷一样

Java:

Time Complexity - O(1)， Space Complexity - O(1)。

public class Solution {public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {int totalArea = (C - A) * (D - B) + (G - E) * (H - F);if (A >= G || B >= H || C <= E || D <= F) {return totalArea;}int sameArea = (Math.min(C, G) - Math.max(A, E)) * (Math.min(D, H) - Math.max(B, F));return totalArea - sameArea;}
}

三刷：

Java:

一开始先计算出两个矩形的面积和 totalArea
判断两个矩形是否相交，假如不相交，或者仅有顶点相交，那么我们直接返回totalArea。这里两个矩形 x 的范围是 (A, C), (E, F), y的范围是(B, D), (E, F)
计算overlap的面积，边的计算公式是 ( 最小的上方或者右方点 - 最大的下方或者左方点)，相乘就是overlap的面积
相减得到结果

public class Solution {public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {int totalArea = (C - A) * (D - B) + (G - E) * (H - F);if (A >= G || C <= E || B >= H || D <= F) {return totalArea;}int overlap = (Math.min(C, G) - Math.max(A, E)) * (Math.min(D, H) - Math.max(B, F));return totalArea - overlap;}
}

Reference:

https://leetcode.com/discuss/39188/an-easy-to-understand-solution-in-java

https://leetcode.com/discuss/39398/my-java-solution-sum-of-areas-overlapped-area

https://leetcode.com/discuss/43549/just-another-short-way

https://leetcode.com/discuss/43173/if-you-want-to-laugh-look-at-my-solution

https://leetcode.com/discuss/54138/python-concise-solution

https://leetcode.com/discuss/51354/an-explanation-in-plain-language

http://www.cnblogs.com/0001/archive/2010/05/04/1726905.html

http://www.geeksforgeeks.org/find-two-rectangles-overlap/

https://www.cs.princeton.edu/~rs/AlgsDS07/17GeometricSearch.pdf

223. Rectangle Area相关推荐

Leet Code OJ 223. Rectangle Area [Difficulty: Easy]
题目: Find the total area covered by two rectilinear rectangles in a 2D plane. Each rectangle is defin ...
leetcode 223. Rectangle Area | 223. 矩形面积（Java）
题目 https://leetcode.com/problems/rectangle-area/ 类似问题:蓝桥杯 BASIC-18 基础练习矩形面积交题解本题的重点在于如何计算重叠部分的面积, ...
LeetCode——223. 矩形面积(Rectangle Area)[中等]——分析及代码（C++）
LeetCode--223. 矩形面积[Rectangle Area][中等]--分析及代码[C++] 一.题目二.分析及代码 1. 几何计算 (1)思路 (2)代码 (3)结果三.其他一.题目 ...
LeetCode 850. Rectangle Area II
题目地址: We are given a list of (axis-aligned) rectangles. Each rectangle[i] = [x1, y1, x2, y2] , where ...
Leetcode题目：Rectangle Area
题目: Find the total area covered by two rectilinear rectangles in a 2D plane. Each rectangle is defin ...
Rectangle Area
Find the total area covered by two rectilinear rectangles in a 2D plane. Each rectangle is defined b ...
leetcode 850. Rectangle Area II | 850. 矩形面积 II（递归分割未重叠矩形）
题目 https://leetcode.com/problems/rectangle-area-ii/ 题解没有看懂官方答案,评论区有一种解法写的挺通俗的: Clean Recursive Solu ...
LeetCode Rectangle Area
题意:给出两个矩形,求其面积和思路:两个矩形可能相交,在求相交面积时,左下角取两个矩形左下角的最大值 ,右上角取两个矩形对应坐标的最小值 ,如果求得的左下角大于右下角,说明不相交,面积为两个矩形面积 ...
继续过中等难度.0309
. 8 String to Integer (atoi) 13.9% Medium . 151 Reverse Words in a String 15.7% Mediu ...

223. Rectangle Area

223. Rectangle Area相关推荐

最新文章

热门文章