Leetcode:Rectangle Area

来源:互联网 发布:seo自动 编辑:程序博客网 时间:2024/06/10 20:34


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.

Rectangle Area

Assume that the total area is never beyond the maximum possible value of int.

主要是判断相交,求相交部分的面积。

class Solution {public:    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {        int result = (C - A) * (D - B) + (G - E) * (H - F);        if (E < C && G > A && F < D && H > B) {            result -= (min(C, G) - max(A, E)) * (min(D, H) - max(B, F));        }                return result;    }};

0 0
原创粉丝点击