LeetCode--No.223--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.

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

Credits:
Special thanks to @mithmatt for adding this problem, creating the above image and all test cases.

Subscribe to see which companies asked this question

啊哈哈哈我果然还是擅长数学题的！

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