rectangle area

Author: fishercoder1534

EASY/src/easy/RectangleArea.java

@@ -0,0 +1,19 @@
+package easy;
+
+public class RectangleArea {
+
+    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;
+    }
+
+}

README.md

@@ -25,6 +25,7 @@
 |278|[First Bad Version](https://leetcode.com/problems/first-bad-version/)|[Solution](../../blob/master/EASY/src/easy/FirstBadVersion.java)| O(logn)|O(1) | Easy| Binary Search
 |273|[Integer to English Words](https://leetcode.com/problems/integer-to-english-words/)|[Solution]| 
 |257|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)|[Solution](../../blob/master/EASY/src/easy/BinaryTreePaths.java) | O(n*h) | O(h) | DFS/Recursion
+|223|[Rectangle Area](https://leetcode.com/problems/rectangle-area/)|[Solution](../../blob/master/EASY/src/easy/RectangleArea.java)| O(1)|O(1) | Easy| 
 |209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)|[Solution](../../blob/master/MEDIUM/src/medium/MinimumSizeSubarraySum.java)| O(n)|O(1) | Medium|
 |206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)|[Solution](../../blob/master/EASY/src/easy/ReverseLinkedList.java)| O(n)|O(1) | Easy
 |205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)|[Solution](../../blob/master/EASY/src/easy/IsomorphicStrings.java)| O(n)|O(1) | Easy