rectangle_area

hitzzc · hitzzc · commit 246b884d85d3 · 2016-10-17T17:25:57.000+08:00
diff --git a/README.md b/README.md
@@ -179,6 +179,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [220. Contains Duplicate III (unsolved)](https://github.com/hitzzc/go-leetcode/tree/master/contains_duplicate_III)
 #### [221. Maximal Square](https://github.com/hitzzc/go-leetcode/tree/master/maximal_square)
 #### [222. Count Complete Tree Nodes](https://github.com/hitzzc/go-leetcode/tree/master/count_complete_tree_nodes)
+#### [223. Rectangle Area](https://github.com/hitzzc/go-leetcode/tree/master/rectangle_area)
 
 
 
diff --git a/rectangle_area/rectangle_area.go b/rectangle_area/rectangle_area.go
@@ -0,0 +1,26 @@
+package rectangle_area
+
+func computeArea(A int, B int, C int, D int, E int, F int, G int, H int) int {
+	if C <= E || G <= A || D <= F || H <= B {
+		return (C-A)*(D-B) + (G-E)*(H-F)
+	}
+	left := max(A, E)
+	bottom := max(B, F)
+	right := min(C, G)
+	top := min(D, H)
+	return (C-A)*(D-B) + (G-E)*(H-F) - (right-left)*(top-bottom)
+}
+
+func min(i, j int) int {
+	if i < j {
+		return i
+	}
+	return j
+}
+
+func max(i, j int) int {
+	if i > j {
+		return i
+	}
+	return j
+}
