Add solution #223

Author: JoshCrozier

README.md

@@ -204,6 +204,7 @@
 220|[Contains Duplicate III](./0220-contains-duplicate-iii.js)|Hard|
 221|[Maximal Square](./0221-maximal-square.js)|Medium|
 222|[Count Complete Tree Nodes](./0222-count-complete-tree-nodes.js)|Easy|
+223|[Rectangle Area](./0223-rectangle-area.js)|Medium|
 224|[Basic Calculator](./0224-basic-calculator.js)|Hard|
 225|[Implement Stack using Queues](./0225-implement-stack-using-queues.js)|Easy|
 226|[Invert Binary Tree](./0226-invert-binary-tree.js)|Easy|

solutions/0223-rectangle-area.js

@@ -0,0 +1,31 @@
+/**
+ * 223. Rectangle Area
+ * https://leetcode.com/problems/rectangle-area/
+ * Difficulty: Medium
+ *
+ * Given the coordinates of two rectilinear rectangles in a 2D plane, return the total area
+ * covered by the two rectangles.
+ *
+ * The first rectangle is defined by its bottom-left corner (ax1, ay1) and its top-right corner
+ * (ax2, ay2).
+ *
+ * The second rectangle is defined by its bottom-left corner (bx1, by1) and its top-right corner
+ * (bx2, by2).
+ */
+
+/**
+ * @param {number} ax1
+ * @param {number} ay1
+ * @param {number} ax2
+ * @param {number} ay2
+ * @param {number} bx1
+ * @param {number} by1
+ * @param {number} bx2
+ * @param {number} by2
+ * @return {number}
+ */
+var computeArea = function(ax1, ay1, ax2, ay2, bx1, by1, bx2, by2) {
+  return (ax2 - ax1) * (ay2 - ay1) + (bx2 - bx1) * (by2 - by1)
+    - Math.max(0, Math.min(ax2, bx2) - Math.max(ax1, bx1))
+    * Math.max(0, Math.min(ay2, by2) - Math.max(ay1, by1));
+};