refactor 223

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_223.java

@@ -1,27 +1,35 @@
 package com.fishercoder.solutions;
 
-/**Find the total area covered by two rectilinear rectangles in a 2D plane.
+/**
+ * 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
 
- Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.
+ Example:
 
- Rectangle Area
- Assume that the total area is never beyond the maximum possible value of int.*/
+ 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 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);
+    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 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);
+            int overlap = 0;
+            if (top > bottom && right > left) {
+                overlap = (top - bottom) * (right - left);
+            }
+            return areaA + areaB - overlap;
         }
-        return areaA + areaB - overlap;
     }
-
 }