package com.fishercoder.solutions;

/**
 * 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.
 * 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.*/
public class _223 {

    public static class Solution1 {
        public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
            int areaA = (C - A) * (D - B);
            int areaB = (G - E) * (H - F);

            int top = Math.min(D, H);
            int bottom = Math.max(B, F);
            int left = Math.max(A, E);
            int right = Math.min(C, G);

            int overlap = 0;
            if (top > bottom && right > left) {
                overlap = (top - bottom) * (right - left);
            }
            return areaA + areaB - overlap;
        }
    }
}

@@ -33,409 +33,8 @@
 s;%0A%0A
-/**%0A * 223. Rectangle Area%0A *%0A * Find the total area covered by two rectilinear rectangles in a 2D plane.%0A * Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.%0A * Rectangle Area%0A%0A Example:%0A%0A Input: A = -3, B = 0, C = 3, D = 4, E = 0, F = -1, G = 9, H = 2%0A Output: 45%0A%0A Note: Assume that the total area is never beyond the maximum possible value of int.*/%0A
 publ

refactor 223