leetcode:223 Rectangle Area－每日編程第三十三題

Valid Sudoku

Total Accepted: 25744 Total Submissions: 91222 Difficulty: Easy

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.

思路：

找出重疊面積，兩個矩形相加，再減去重疊面積。

class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int leftx=max(A,E);
        int lefty=max(B,F);
        int rightx=min(C,G);
        int righty=min(D,H);
        int cover;
        if(rightx>leftx&&righty>lefty){
            cover = (rightx-leftx)*(righty-lefty);
        }else{
            cover=0;
        }
        return (C-A)*(D-B)+(G-E)*(H-F)-cover;
    }
};