LeetCode 223. Rectangle Area

223. Rectangle Area

Medium

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
Note:

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

题意

给定两个用对角点表示的矩形,求矩形的总覆盖面积(其实就是求矩形的相交面积)

思路

简单的分情况讨论

代码

class Solution {
private:
    inline void swap(int &a, int &b) {
        int tmp = a;
        a = b;
        b = tmp;
    }
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        // ensure A <= E
        if (A > E) {
            swap(A, E);
            swap(B, F);
            swap(C, G);
            swap(D, H);
        }
        return D <= F || C <= E || H <= B? (long)(C-A)*(long)(D-B) + (long)(G-E)*(long)(H-F): (long)(C-A)*(long)(D-B) + (long)(G-E)*(long)(H-F) - (long)(min(D, H) - max(B, F)) * (long)(min(C, G) - max(A, E));
    }
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值