2019-08-03

Author: JiayangWu

0223.矩形面积/0223-矩形面积.py

@@ -0,0 +1,22 @@
+class Solution(object):
+    def computeArea(self, A, B, C, D, E, F, G, H):
+        """
+        :type A: int
+        :type B: int
+        :type C: int
+        :type D: int
+        :type E: int
+        :type F: int
+        :type G: int
+        :type H: int
+        :rtype: int
+        """
+        # [A, C]ºÍ[E, G]È¡½»¼¯, [B, D]ºÍ[F, H]È¡½»¼¯
+        if min(C, G) - max(A, E) < 0 or min(D, H) - max(B, F) < 0:
+            S_overlap = 0
+        else:
+            S_overlap = (min(C, G) - max(A, E)) * (min(D, H) - max(B, F))
+        S_first_square = (D - B) * (C - A)
+        S_second_square = (H - F) * (G - E)
+        # print S_second_square, S_first_square, S_overlap
+        return S_second_square + S_first_square - S_overlap

0226.翻转二叉树/0226-翻转二叉树.py

@@ -15,8 +15,6 @@ def invertTree(self, root):
             return root
         left = root.left
         right = root.right
-        root.right = self.invertTree(left)
         root.left = self.invertTree(right)
-        return root
-
-    
+        root.right = self.invertTree(left)
+        return root