码迷,mamicode.com
首页 > 其他好文 > 详细

leetcode 223: Rectangle Area

时间:2018-04-25 10:56:06      阅读:151      评论:0      收藏:0      [点我收藏+]

标签:分享图片   maximum   rgb   strong   ever   思路   display   reg   its   

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


leetcode 223: Rectangle Area

标签:分享图片   maximum   rgb   strong   ever   思路   display   reg   its   

原文地址:https://www.cnblogs.com/llguanli/p/8940717.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!