2019-07-13

Author: JiayangWu

1118.一月有多少天/1118-一月有多少天.py

@@ -0,0 +1,13 @@
+class Solution(object):
+    def numberOfDays(self, Y, M):
+        """
+        :type Y: int
+        :type M: int
+        :rtype: int
+        """
+        
+        if  (Y % 100 != 0 and Y % 4 ==0) or (Y % 100 == 0 and Y % 400 == 0) :
+            return [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][M - 1]
+        else:
+            return [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][M - 1]
+        

1119.删去字符串中的元音/1119-删去字符串中的元音.py

@@ -0,0 +1,12 @@
+class Solution(object):
+    def removeVowels(self, S):
+        """
+        :type S: str
+        :rtype: str
+        """
+        res = ""
+        for char in S:
+            if char not in "aeiou":
+                res += char
+                
+        return res

1120.子树的最大平均值/1120-子树的最大平均值.py

@@ -0,0 +1,23 @@
+# 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 maximumAverageSubtree(self, root):
+        """
+        :type root: TreeNode
+        :rtype: float
+        """
+        if not root:
+            return 0
+        
+        def inorder(node):
+            if not node:
+                return []
+            return inorder(node.left) + [node.val] + inorder(node.right)
+        
+        Inorder = inorder(root)
+        return max(1.0 * sum(Inorder) / len(Inorder), self.maximumAverageSubtree(root.left), self.maximumAverageSubtree(root.right))

1121.将数组分成几个递增序列/1121-将数组分成几个递增序列.py

@@ -0,0 +1,16 @@
+class Solution(object):
+    def canDivideIntoSubsequences(self, nums, K):
+        """
+        :type nums: List[int]
+        :type K: int
+        :rtype: bool
+        """
+        if len(nums) < K:
+            return False
+        from collections import Counter
+        d = Counter(nums)
+        maxx = 1
+        for key, val in d.items():
+            maxx = max(val, maxx)
+            
+        return maxx * K <= len(nums)