Tc的专栏

待重头,收拾旧山河,朝天阙

LeetCode 223 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.

Rectangle Area
Assume that the total area is never beyond the maximum possible value of in.


题目链接:https://leetcode.com/problems/rectangle-area/

题目分析:主要是找重复,总的减去重复的即可

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 buttom = Math.max(B, F);
        int top = Math.min(D, H);
        int right = Math.min(C, G);
        int left = Math.max(A, E);
        int both;
        if(buttom > top || left > right) {
            both = 0;
        }
        else {
            both = (top - buttom) * (right - left);
        }
        return area1 + area2 - both;
    }
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Tc_To_Top/article/details/52371190
文章标签: leetcode 几何
个人分类: Leetcode Easy
所属专栏: LeetCode
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭