2019-07-07

Author: JiayangWu

5117.IP地址无效化/5117-IP地址无效化.py

@@ -0,0 +1,8 @@
+class Solution(object):
+    def defangIPaddr(self, address):
+        """
+        :type address: str
+        :rtype: str
+        """
+        address = address.replace(".", "[.]")
+        return address

5118.航班预订统计/5118-航班预订统计.py

@@ -0,0 +1,17 @@
+class Solution(object):
+    def corpFlightBookings(self, bookings, n):
+        """
+        :type bookings: List[List[int]]
+        :type n: int
+        :rtype: List[int]
+        """
+        f = [0 for _ in range(n + 1)]
+        
+        for i, j, k in bookings:
+            f[i - 1] += k
+            f[j] -= k
+        # print f    
+        for i in range(1, n + 1):
+            f[i] += f[i - 1]
+        # print f
+        return f[:-1]

5119.删点成林/5119-删点成林.py

@@ -0,0 +1,58 @@
+# Definition for a binary tree node.
+# class TreeNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution(object):
+    def delNodes(self, root, to_delete):
+        """
+        :type root: TreeNode
+        :type to_delete: List[int]
+        :rtype: List[TreeNode]
+        """
+        if not root:
+            return []
+        to_delete = set(to_delete)
+        
+        res = []
+        
+        self.roots = []
+        if root.val not in to_delete:
+            self.roots = [root]
+        else: #如果连根节点都要删掉
+            if root.left and root.left.val not in to_delete:
+                self.roots += [root.left]
+            if root.right and root.right.val not in to_delete:
+                self.roots += [root.right]
+        
+        def dfs(node):
+            if not node:
+                return
+
+            if node.left and node.left.val in to_delete:  #左节点要删
+                dfs(node.left)
+                if node.left.left: #左节点的左节点还在，不需要删
+                    self.roots += [node.left.left]
+                if node.left.right: #左节点的右节点还在，不需要删
+                    self.roots += [node.left.right]
+                
+                node.left = None
+                
+            if node.right and node.right.val in to_delete:#右节点要删
+                dfs(node.right)
+                if node.right.left: #右节点的左节点还在，不需要删
+                    self.roots += [node.right.left]
+                if node.right.right: #右节点的右节点还在，不需要删
+                    self.roots += [node.right.right]
+                
+                node.right = None
+
+            dfs(node.left)
+            dfs(node.right)
+            
+        dfs(root)
+        return self.roots
+            
+            

5120.有效括号的嵌套深度/5120-有效括号的嵌套深度.py

@@ -0,0 +1,17 @@
+class Solution(object):
+    def maxDepthAfterSplit(self, seq):
+        """
+        :type seq: str
+        :rtype: List[int]
+        """
+        # print self.depth("((()))")
+        res = [0 for _ in range(len(seq))]
+        cnt = 0
+        for i, x in enumerate(seq):
+            if x == "(":
+                cnt += 1
+                res[i] = cnt % 2
+            else:
+                res[i] = cnt % 2
+                cnt -= 1
+        return res