LeetCode No.223 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.

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 ;
    }
};