[LeetCode] Rectangle Area

标签：c++   leetcode   

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.

Credits:
Special thanks to @mithmatt for adding this problem, creating the above image and all test cases.

解题思路：

题意为计算两个矩形总共覆盖的面积，计算方法为矩形1的面积+矩形2的面积-两个矩形共同的覆盖面积。

class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int overLeft = max(A, E);
        int overBottom = max(B, F);
        int overRight = min(C, G);
        int overTop = min(D, H);
        
        int overArea = 0;
        if(overLeft>=overRight || overBottom>=overTop){
            overArea = 0;
        }else{
            overArea = (overRight-overLeft) * (overTop - overBottom);
        }
        return (C-A)*(D-B) + (G-E)*(H-F) - overArea;
    }
};

[LeetCode] Rectangle Area

标签：c++   leetcode   

原文地址：http://blog.csdn.net/kangrydotnet/article/details/46520499