#Leetcode# 223. Rectangle Area

最新推荐文章于 2024-11-01 23:55:42 发布

weixin_30267697

最新推荐文章于 2024-11-01 23:55:42 发布

阅读量69

点赞数

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/zlrrrr/p/10696946.html

版权

https://leetcode.com/problems/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.

Rectangle Area

Example:

Input: A = -3, B = 0, C = 3, D = 4, E = 0, F = -1, G = 9, H = 2 Output: 45

代码：

class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int sum1 = (C - A) * (D - B), sum2 = (H - F) * (G - E);
        if (E >= C || F >= D || B >= H || A >= G) return sum1 + sum2;
        return sum1 - ((min(G, C) - max(A, E)) * (min(D, H) - max(B, F))) + sum2;
    }
};

转载于:https://www.cnblogs.com/zlrrrr/p/10696946.html