regular_expression_matching

Author: hitzzc

README.md

@@ -11,6 +11,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [7. reverse integer](https://.com/hitzzc/go-leetcode/tree/master/reverse_integer)
 #### [8. string to integer](https://.com/hitzzc/go-leetcode/tree/master/string_to_integer)
 #### [9. palindrome number](https://.com/hitzzc/go-leetcode/tree/master/palindrome_number)
+#### [10. Regular Expression Matching](https://.com/hitzzc/go-leetcode/tree/master/regular_expression_matching)
 #### [11. container with most water](https://.com/hitzzc/go-leetcode/tree/master/container_with_most_water)
 #### [12. integer to roman](https://.com/hitzzc/go-leetcode/tree/master/integer_to_roman)
 #### [13. roman to integer](https://.com/hitzzc/go-leetcode/tree/master/roman_to_integer)

regular_expression_matching/regular_expression_matching.cpp

@@ -0,0 +1,26 @@
+class Solution {
+public:
+bool isMatch(string s, string p) {
+return isMatch(s, p, s.size(), p.size());
+}
+bool isMatch(string& s, string& p, int i, int j) {
+if (i == 0 && j == 0) return true;
+if (i != 0 && j == 0) return false;
+if (i == 0 && j != 0) {
+if (p[j-1] == '*') {
+return isMatch(s, p, i, j-2);
+}
+return false;
+}
+if (s[i-1] == p[j-1] || p[j-1] == '.') {
+return isMatch(s, p, i-1, j-1);
+} else if (p[j-1] == '*') {
+if (isMatch(s, p, i, j-2)) return true;
+if (s[i-1] == p[j-2] || p[j-2] == '.') {
+return isMatch(s, p, i-1, j);
+}
+return false;
+}
+return false;
+}
+};