LeetCode223 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

Note:

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

思路:

我们只需要将重叠的区域的面积计算出来,然后让两个矩形的面积相加减去重叠的矩形的面积就可以了。

class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
		double total = double(C - A)*(D - B) + (G - E)*(H - F);

		int x1, y1, x2, y2;
		if (A <= E && E <= C) x1 = E;
		else if (E <= A && A <= G) x1 = A;
		else return total;

		if (F <= B && B <= H) y1 = B;
		else if (B <= F && F <= D) y1 = F;
		else return total;

		if (E <= C && C <= G) x2 = C;
		else if (A <= G && G <= C) x2 = G;
		else return total;

		if (B <= H && H <= D) y2 = H;
		else if (F <= D && D <= H) y2 = D;
		else return total;

		return total - (x2 - x1) * (y2 - y1);
    }
};

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值