关闭

LeetCode 223 Rectangle Area

标签: leetcode几何
336人阅读 评论(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.

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


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:575811次
    • 积分:13521
    • 等级:
    • 排名:第949名
    • 原创:802篇
    • 转载:7篇
    • 译文:0篇
    • 评论:119条
    博客专栏