2020-07-19

Author: JiayangWu

0312.戳气球/0312-戳气球.py

@@ -0,0 +1,18 @@
+class Solution(object):
+    def maxCoins(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: int
+        """
+        if not nums:
+            return 0
+    
+        nums = [1] + nums + [1]
+        n = len(nums)
+        dp = [[0 for _ in range(n)] for _ in range(n)]
+        
+        for i in range(n-2, -1, -1):
+            for j in range(i+1, n):
+                for k in range(i+1, j):
+                    dp[i][j] = max(dp[i][j], dp[i][k] + nums[i]*nums[k]*nums[j] + dp[k][j])
+        return dp[0][-1]

0459.重复的子字符串/0459-重复的子字符串.py

@@ -0,0 +1,10 @@
+class Solution(object):
+    def repeatedSubstringPattern(self, s):
+        """
+        :type s: str
+        :rtype: bool
+        """
+        for i in range(0, len(s) - 1):
+            if s[:i + 1] * (len(s) //(i + 1)) == s:
+                return True
+        return False