leetcode 223: Rectangle Area

最新推荐文章于 2020-09-13 00:05:52 发布

xudli

最新推荐文章于 2020-09-13 00:05:52 发布

阅读量9.5k

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/xudli/article/details/46435335

版权

leetcode 专栏收录该内容

216 篇文章 0 订阅

订阅专栏

Rectangle Area

Total Accepted: 2205 Total Submissions: 8138

Find the total area covered by two rectilinear rectangles in a2D 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.

[思路]

求出两个区域的面积, 然后减去overlapping的区域, 即为所求.

[CODE]

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);
        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;
    }
}