72. 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.

分析：求最后结果是两个矩形面积相加减去公共部分的面积。

两个矩形面积分别为area1 = (C-A)*(D-B);和area2 = (G-E)*(H-F);

公共部分面积的 重叠部分的宽： int h1 = Math.min(G, C)-Math.max(E, A);
重叠部分的长： int h2 = Math.min(D, H)-Math.max(B, F);

当h1<0或者h2<0的时候公共面积部分为0.但是由于计算h1和h2的时候有减法运算，为避免结果因为溢出而出错，所以判断条件为Math.min(G, C)>Math.max(E, A) && Math.min(D, H)>Math.max(B, F)时采取计算公共部分的面积。

 public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
		 /*重叠部分的宽*/
		 int h1 = Math.min(G, C)-Math.max(E, A);
		 /*重叠部分的长*/
		 int h2 = Math.min(D, H)-Math.max(B, F);
		 /*重叠部分的面积*/
		 int commonArea = 0;
		 /*直接计算h1和h2的时候可能会因为结果Math.min(G, C)等这四个数太大而导致溢出*/
		 if(Math.min(G, C)>Math.max(E, A) && Math.min(D, H)>Math.max(B, F)){
			 commonArea = h1*h2;
		 }
		 System.out.println("h1 = "+h1+" h2 = "+h2+" h1*h2 = "+h1*h2);
		 int area1 = (C-A)*(D-B);
		 int area2 = (G-E)*(H-F);
		 /*返回的结果就是总的面积减去公共的面积*/
		 return area1+area2-commonArea;
	 }