LeetCode(223)_Rectangle Area

最新推荐文章于 2024-09-19 08:57:00 发布

夏大兔

最新推荐文章于 2024-09-19 08:57:00 发布

阅读量231

点赞数

文章标签： leetcode

本文链接：https://blog.csdn.net/xiayiqian71/article/details/52957573

版权

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, area2, area3, area_re, area;
        area1 = (C-A) * (D-B);
        area2 = (G-E) * (H-F);

        //Point!!!
        area_re = ( ((G<=C)?G:C) - ((A>=E)?A:E) ) * ( ((H<=D)?H:D) - ((B>=F)?B:F)  );

        if( (C<E) | (B>H) | (A>G) | (D<F) )
            area3 = 0;
        else
            area3 = area_re;

        area = area1+area2-area3;
        return area;
    }