No.223 Rectangle Area

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.

　　求两个矩形相交的面积
　　垂直矩形，每个矩形由左下角和右上角两个点的坐标表示
　　其实就是求区间段[B,D]和[F,H]相交区域 * [A,C]和[E,G]相交区域（×）
　　题意理解有问题：是求两个矩形表示的区域的面积，而不是求其交集!!!

　　这么简单一问题都出错了!!

#include "stdafx.h"
#include <map>
#include <vector>
#include <iostream>
using namespace std;

class Solution
{
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H)
    {//求两个矩形相交的面积
     //垂直矩形，每个矩形由左下角和右上角两个点的坐标表示
     //其实就是求区间段[B,D]和[F,H]相交区域 * [A,C]和[E,G]相交区域（×）
     //题意理解有问题：是求两个矩形表示的区域的面积，而不是求其交集!!!
        int area = (C-A)*(D-B) + (G-E)*(H-F);
        if(F>=D || B>=H || E>=C || A>=G)//不相交
            return area;
        //只考虑到相交，没考虑到包含!!!
        int length = min(D,H) - max(B,F);//式子也算错!!!
        int width = min(C,G) - max(A,E);
        
        return area - length*width;
    }
};

int main()
{
    Solution sol;
    
    cout << sol.computeArea(0,0,0,0,-1,-1,1,1) <<endl;
    cout << sol.computeArea(-3,0,3,4,0,-1,9,2) <<endl;    
    cout << sol.computeArea(0,-1,9,2,-3,0,3,4) <<endl;    
    cout << sol.computeArea(-2,1,-1,3,0,1,1,3) <<endl;

}