开始刷leetcode day79: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.




Java:

public class Solution {
    public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int sq1 = (C-A)*(D-B);
        int sq2 = (G-E)*(H-F);
        long left = (long)Math.min(C,G) - (long)Math.max(A,E);
        if(left <0) left = 0;
        long right = (long)Math.min(D,H) - (long)Math.max(B,F);
        if(right <0) right = 0;
        return (int)(sq1+sq2 - left*right);
    }
}

你可能感兴趣的:(leetcode)