LeetCode 0223 - Rectangle Area

Reck Zhang

发布于 2021-08-11 12:14:36

2740

发布于 2021-08-11 12:14:36

文章被收录于专栏：Reck ZhangReck Zhang

Rectangle Area

Desicription

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.

Example:

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

Note:

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

Solution

class Solution {
public:
    long long computeArea(long long A, long long B, long long C, long long D, long long E, long long F, long long G, long long H) {
        long long length_x  = C - A + G - E - (max(C, G) - min(A, E));
        if(length_x <= 0) {
            length_x =  0;
        }
        long long length_y = D - B + H - F - (max(D, H) - min(B, F));
        if(length_y <= 0) {
            length_x = 0;
        }
        return (C -A) * (D - B) + (G - E) * (H - F) - length_x * length_y;
    }
};

本文参与腾讯云自媒体分享计划，分享自作者个人站点/博客。

原始发表：2018-07-04，如有侵权请联系 cloudcommunity@tencent.com 删除

area