leetcode oj java Rectangle Area

最新推荐文章于 2017-02-15 21:35:39 发布

Whu_Xcy

最新推荐文章于 2017-02-15 21:35:39 发布

阅读量493

点赞数

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

本文链接：https://blog.csdn.net/u011060119/article/details/49981481

版权

leetcode 专栏收录该内容

76 篇文章 0 订阅

订阅专栏

问题：

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 overlapRegion = overlap(A, B, C, D, E, F, G, H);
        return area1 + area2 - overlapRegion;
    }
    
    private 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);
        if(h2<h1){return 0;}
        
        int v1 = Math.max(B, F);
        int v2 = Math.min(D, H);
        if(v2<v1){return 0;}

        else return (h2-h1)*(v2-v1);
    }
}

其中在函数overlap ，最初是用这个：

private 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(h<=0 || v<=0) return 0;
        else return h*v;
    }

在遇到cast L -150000001的时候运算出错，原因在于计算h = h2 - h1 的时候溢出，变为正值，运算出错。修改之后通过所有的test cases