add 10

Author: luliyucoordinate

README.md

@@ -11,7 +11,7 @@ LeetCode
 |0005|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | c | [c++](./src/0005-Longest-Palindromic-Substring/0005.cpp) |[python](./src/0005-Longest-Palindromic-Substring/0005.py)|||Medium|
 |0006|[ZigZag Conversion](https://leetcode.com/problems/third-maximum-number/) | c | [c++]() |python|||Medium|
 |0007|[Reverse Integer](https://leetcode.com/problems/arithmetic-slices/) | c | [c++]() |python|||Easy|
-|0008|[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | c | [c++]() |python|||Medium|
+|0008|[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | c | [c++](./src/0010-Regular-Expression-Matching/0010.cpp) |[python](./src/0010-Regular-Expression-Matching/0010.py)|||Medium|
 |0009|[Palindrome Number](https://leetcode.com/problems/split-array-largest-sum/) | c | [c++]() |python|||Easy|
 |0010|[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | c | [c++]() |python|||Hard|
 |0011|[Container With Most Water](https://leetcode.com/problems/queue-reconstruction-by-height/) | c | [c++](./src/0011-Container-With-Most-Water/0011.cpp)|[python](./src/0011-Container-With-Most-Water/0011.cpp)|||Medium|

src/0010-Regular-Expression-Matching/0010.cpp

@@ -0,0 +1,37 @@
+#include <string>
+#include <iostream>
+using namespace std;
+
+static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
+class Solution 
+{
+public:
+    bool isMatch(string s, string p) 
+    {
+        int m = s.length(), n = p.length(); 
+        vector<vector<bool>> mem(m + 1, vector<bool> (n + 1, false));
+        mem[0][0] = true;
+    	for (int j = 1; j <= n; j++) mem[0][j] = p[j-1] == '*' && mem[0][j-2];
+        for (int i = 1; i <= m; i++)
+        {
+            for (int j = 1; j <= n; j++)
+            {
+                if (p[j - 1] == '*')
+                    mem[i][j] = mem[i][j - 2] || 
+                    (i > 0 && (s[i - 1] == p[j - 2] || 
+                    p[j - 2] == '.') && mem[i - 1][j]);
+                else mem[i][j] = i > 0 && 
+                    mem[i - 1][j - 1] && 
+                    (s[i - 1] == p[j - 1] || p[j - 1] == '.');
+            }
+        }
+        return mem[m][n];
+    }
+};
+int main()
+{
+    string s = "baccbbcbcacacbbc";
+    string p = "c*.*b*c*ba*b*b*.a*";
+    cout << Solution().isMatch(s, p) << endl;
+    return 0;
+}

src/0010-Regular-Expression-Matching/0010.py

@@ -0,0 +1,23 @@
+class Solution:
+    def isMatch(self, s, p):
+        mem = {}
+        def _isMatch(i, j):
+            if (i, j) not in mem:
+                if j == len(p):
+                    result = i == len(s)
+                else:
+                    first_match = i < len(s) and p[j] in (s[i], '.')
+                    if j + 1 < len(p) and p[j+1] == '*':
+                        result = _isMatch(i, j+2) or (first_match and _isMatch(i+1, j))
+                    else:
+                        result = first_match and _isMatch(i+1, j+1)
+                mem[i, j] = result
+            return mem[i, j]
+
+        return _isMatch(0,0)
+
+        
+if __name__ == "__main__":
+    s = "baccbbcbcacacbbc"
+    p = "c*.*b*c*ba*b*b*.a*"
+    print(Solution().isMatch(s, p))