2019-09-14

Author: JiayangWu

5189.“气球”的最大数量/5189-“气球”的最大数量.py

@@ -0,0 +1,15 @@
+class Solution(object):
+    def maxNumberOfBalloons(self, text):
+        """
+        :type text: str
+        :rtype: int
+        """
+        dic = collections.Counter(text)
+        #balloon
+        min_count = 99999999
+        for char in "balon":
+            tmp = dic[char]
+            if char in "lo":
+                tmp /= 2
+            min_count = min(min_count, tmp)
+        return min_count

5191.K次串联后最大子数组之和/5191-K次串联后最大子数组之和.py

@@ -0,0 +1,36 @@
+class Solution(object):
+    def kConcatenationMaxSum(self, arr, k):
+        """
+        :type arr: List[int]
+        :type k: int
+        :rtype: int
+        """
+        if max(arr) < 0:
+            return 0
+        if sum(arr) > 0:
+            res = sum(arr) * (k - 2)
+            dp = [0] * len(arr)
+            dp[0] = arr[0]
+            for i in range(1,len(arr)):
+                dp[i] = dp[i - 1] + arr[i]
+                    
+            res += max(dp)
+            dp = [0] * len(arr)
+            dp[-1] = arr[-1]
+            for i in range(len(arr) - 2, -1, -1):
+                dp[i] = dp[i + 1] + arr[i]
+                    
+            res += max(dp)
+            return (res)% (10 ** 9 + 7)
+        
+        arr = arr + arr
+        dp = [0] * len(arr)
+        dp[0] = arr[0]
+        for i in range(1,len(arr)):
+            if dp[i - 1] > 0:
+                dp[i] = dp[i - 1] + arr[i]
+            else:
+                dp[i] = arr[i]
+                
+        return max(dp) % (10 ** 9 + 7)
+