LeetCode-Rectangle Area

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 int.

 

public class Solution {
    public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int res=(C-A)*(D-B)+(G-E)*(H-F);
        int A1=Math.max(A,E), B1=Math.max(B,F), C1=Math.min(C,G), D1=Math.min(D,H);
        if (D1 <= B1 || C1 <= A1) return res;
        return res - (D1 - B1) * (C1 - A1);

    }
}

　　

二刷：

先找到不响交的条件，在找橡胶的情况下如何求得各个点位

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

 

转载于:https://www.cnblogs.com/incrediblechangshuo/p/5510699.html