Merge branch 'master' of github.com:doocs/leetcode

Author: yanglbme

solution/0000-0099/0005.Longest Palindromic Substring/Solution.py

@@ -0,0 +1,24 @@
+class Solution:
+    def longestPalindrome(self, s: str) -> str:
+        dp = [[0 for _ in range(len(s) + 1)] for _ in range(len(s) + 1)]
+
+        for i in range(len(s)):
+            dp[i][i] = 1
+        
+        for i in range(len(s) - 1, -1, -1):
+            for j in range(i + 1, len(s)):
+                if s[i] == s[j]:
+                    if i + 1 == j:
+                        dp[i][j] = 2
+                    elif i + 2 == j:
+                        dp[i][j] = 3
+                    else:
+                        if dp[i + 1][j - 1] != 0:
+                            dp[i][j] = 2 + dp[i + 1][j - 1]
+        maximum = max(map(max, dp))
+        if maximum == 0:
+            return ""
+        for i in range(len(s)):
+            for j in range(len(s)):
+                if dp[i][j] == maximum:
+                    return s[i: j + 1]

solution/0100-0199/0118.Pascal's Triangle/Solution.py

@@ -0,0 +1,18 @@
+class Solution:
+    def generate(self, numRows: int) -> List[List[int]]:
+        res = [[1], [1, 1]]
+        if numRows == 0:
+            return []
+        elif numRows == 1:
+            return [res[0]]
+
+        # from the 3. row on 
+        for i in range(2, numRows):
+            counter = 1
+            temp = [1, 1]
+            # should add len(res[i - 1]) - 1 elements in to temp
+            for j in range(len(res[i - 1]) - 1):
+                temp.insert(counter, res[i - 1][j] + res[i - 1][j + 1])
+                counter += 1
+            res.append(temp)
+        return res