leetcode 223. Rectangle Area

Decorator2015

于 2016-06-13 10:00:02 发布

阅读量454

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/Decorator2015/article/details/51655328

版权

Leetcode 专栏收录该内容

48 篇文章

订阅专栏

题目

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.

解

public class Solution {
    public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
       int area1=(C-A)*(D-B);
       int area2=(G-E)*(H-F);

       int overlaparea=overlap(A,B,C,D,E,F,G,H);

       return area1+area2-overlaparea;

    }


    public int overlap(int A, int B, int C, int D, int E, int F, int G, int H) {

       int h1=Math.max(A, E);
       int h2=Math.min(C, G);
       int h=h2-h1;

       int v1=Math.max(B, F);
       int v2=Math.min(D, H);
       int v=v2-v1;

       if(h1>h2 ||v1>v2)
           return 0;
       else
           return h*v;                  
     }
}