【leetcode】223. Rectangle Area

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/ghscarecrow/article/details/86651266

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

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.

题解如下

class Solution {
    public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int left = Math.max(A,E);
        int right = Math.max(left,Math.min(C,G));
        int bottom = Math.max(B,F);
        int up = Math.max(bottom,Math.min(D,H));
        return (C - A) * (D - B) + (G - E) * (H - F) - (right - left) * (up - bottom);
    }
}

猜你喜欢

转载自blog.csdn.net/ghscarecrow/article/details/86651266