标签：ane   png   lan   idt   value   tput   src   Plan   maximum   

Rectangle Area (M)

题目

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.

Example:

Input: A = -3, B = 0, C = 3, D = 4, E = 0, F = -1, G = 9, H = 2
Output: 45

Note:

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

题意

计算两个矩形一共占据的面积。

思路

所求结果为总面积和减去重叠部分面积。

代码实现

Java

class Solution {
    public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int S = (C - A) * (D - B) + (G - E) * (H - F);
        if (C >= E && G >= A && D >= F && H >= B) {
            int length = (C - A + G - E) - (Math.max(C, G) - Math.min(A, E));
            int width = (D - B + H - F) - (Math.max(D, H) - Math.min(B, F));
            S -= length * width;
        }
        return S;
    }
}

0223. Rectangle Area (M)

标签：ane   png   lan   idt   value   tput   src   Plan   maximum   

原文地址：https://www.cnblogs.com/mapoos/p/13193753.html