LeetCode:Rectangle Area
1、题目:
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.
Assume that the total area is never beyond the maximum possible value of int.
2、代码:
这个写的真是心酸,明明很简单可以解决的问题,求出交叉面积就可以了,却让我一步一步陷入迷途。
class Solution {
public:
int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
int i=max(A,E),j=max(B,F),k=min(C,G),l=min(D,H);
if(i<=k&&j<=l)//交叉部分
{
return (C-A)*(D-B)+(G-E)*(H-F)-(k-i)*(l-j);
}
else
{
return (C-A)*(D-B)+(G-E)*(H-F);
}
}
};
3、总结:
这个思路本来我也是这样的,两个矩形面积和-交叉面积,可是后来我怕不好求交叉面积,就放弃了。几经波折发现,画几个图就知道求了。