add 10

Author: Alarical

.gitignore

@@ -74,6 +74,7 @@ docs/_build/
 # PyBuilder
 target/
 .idea
+.gitignore
 
 # Jupyter Notebook
 .ipynb_checkpoints

README.md

@@ -30,4 +30,5 @@ LeetCode
 | 25 |153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problemset/all/) | c++ | [python](./solution/153FindMinimuminRotatedSortedArray.py) | binary search | M | 2019/04/28 |
 | 26 |72|[Edit Distance](https://leetcode.com/problemset/all/) | c++ | [python](./solution/72EditDistance.py) | dp | H | 2019/05/21 |
 | 27 |1190|[Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problemset/all/) | c++ | [python](./solution/1190ReverseSubstringsBetweenEachPairofParentheses.py) | stack | M | 2019/09/17 |
+| 28 |10|[Regular Expression Matching](https://leetcode.com/problemset/all/) | c++ | [python](./solution/10RegularExpressionMatching.py) | 双序列dp | H | 2019/09/18 |
 

solution/10RegularExpressionMatching.py

@@ -2,11 +2,28 @@ class Solution:
     def isMatch(self, s: str, p: str) -> bool:
         m = len(s)
         n = len(p)
-        dp = [False *(n+1) for _ in range(m+1)]
+        dp = [[False] * (n + 1) for _ in range(m + 1)]
         # dp[i][j] =
-        # dp[i-1][j-1] 如果 i > 0 , 并且 p[j-1] == '.' or s[i-1] == p[j-1]
-        # dp[i][j-2] (表示不用 *x ) or ( dp[i-1][j] and (s[i-1] == p[j-1] or p[j-2] == '.') )
-        # if p[j-1] == '*'
-        for i in range(m+1):
-            for j in range(n+1):
-                dp[][]
+        # dp[i-1][j-1] 如果 i > 0 , 并且 p[j-1] == '.' or s[i-1] == p[j-1]  或
+        # (dp[i][j-2] (表示不用 *x ) or ( dp[i-1][j] 在 (s[i-1] == p[j-1] or p[j-2] == '.') )
+        # if p[j-1] == '*')
+        for i in range(m + 1):
+            for j in range(n + 1):
+                if i == 0 and j == 0:
+                    dp[i][j] = True
+                    continue
+                if j == 0:
+                    dp[i][j] = False
+                    continue
+                # j > 0
+                dp[i][j] = False
+                if p[j - 1] != '*':
+                    if i > 0 and (p[j - 1] == '.' or s[i - 1] == p[j - 1]):
+                        dp[i][j] = dp[i - 1][j - 1]
+                else:
+                    if j > 1:
+                        dp[i][j] |= dp[i][j - 2]
+                    if i > 0 and j > 1:
+                        if s[i - 1] == p[j - 2] or p[j - 2] == '.':
+                            dp[i][j] |= dp[i - 1][j]
+        return dp[m][n]