LeetCode Rectangle Area

Description:

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

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

Solution:

分别求面积,然后减去重合部分的即可。

public class Solution {
    public int computeArea(int A, int B, int C, int D, int E, int F, int G,
			int H) {
		return (C - A) * (D - B) + (G - E) * (H - F) - cover(A, C, E, G)
				* cover(B, D, F, H);
	}

	int cover(int a, int b, int c, int d) {
		if (a > c) {
			int temp;

			temp = a;
			a = c;
			c = temp;

			temp = b;
			b = d;
			d = temp;
		}
		if (c >= b)
			return 0;
		if (d <= b)
			return d - c;
		return b - c;
	}
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值