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.
===================================================================
题目链接:https://leetcode.com/problems/rectangle-area/
题目大意:求出两个矩形围成的面积。
思路:等于area1+area2-common。
参考代码:
class Solution {
public:
int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
int ans = ( C - A ) * ( D - B ) + ( G - E ) * ( H - F ) ;
if ( E > C || G < A || F > D || H < B )
return ans;
int x = min ( C , G ) - max ( A , E ) , y = min ( D , H ) - max ( B , F ) ;
return ans - x * y ;
}
};