leecode 223 Rectangle Area

walter1990

于 2016-06-26 10:48:31 发布

阅读量299

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.youkuaiyun.com/suichen1/article/details/51761839

Leetcode 专栏收录该内容

127 篇文章

订阅专栏

本文介绍了一种计算两个直角矩形在二维平面上总覆盖面积的方法。每个矩形由其左下角和右上角定义。通过比较并计算重叠部分来得出最终结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Credits:
Special thanks to @mithmatt for adding this problem, creating the above image and all test cases.

Subscribe to see which companies asked this question

class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int width = 0, height = 0;

		if(E >= C) width = 0;
		else if(G <= A) width = 0;
		else width = min(C,G)-max(E,A);
        
		if(H <= B || F >= D) height = 0;
        else {
		    int tmp1 = B > F ? B : F, tmp2 = D > H ? H : D;

		    height = abs(tmp2-tmp1);
        }
        
		int cover = 0;

		cover = (C-A)*(D-B)+(G-E)*(H-F);

		return cover - width*height;
    }
};