Q10 Regular Expression Matching

Given an input string (s) and a pattern §, implement regular expression matching with support for ‘.’ and ‘*’.

‘.’ Matches any single character.
‘*’ Matches zero or more of the preceding element.
The matching should cover the entire input string (not partial).

Note:

s could be empty and contains only lowercase letters a-z.
p could be empty and contains only lowercase letters a-z, and characters like . or *.
Example 1:

Input:
s = “aa”
p = “a”
Output: false
Explanation: “a” does not match the entire string “aa”.
Example 2:

Input:
s = “aa”
p = “a*”
Output: true
Explanation: ‘*’ means zero or more of the precedeng element, ‘a’. Therefore, by repeating ‘a’ once, it becomes “aa”.
Example 3:

Input:
s = “ab”
p = “."
Output: true
Explanation: ".” means “zero or more (*) of any character (.)”.
Example 4:

Input:
s = “aab”
p = “cab”
Output: true
Explanation: c can be repeated 0 times, a can be repeated 1 time. Therefore it matches “aab”.
Example 5:

Input:
s = “mississippi”
p = “misisp*.”
Output: false
我们参考了LeetCode上的标准解答：here。这里主要是需要注意一个问题：我们能不能从前往后进行动态规划。从直观上讲，从前往后和从后往前都是一样的，但是再实际操作的时候，从前往后会出现因为"*"而无法判别前面状态的情况。所以我们最终使用的是从后往前的实现方法。

class Solution {
public:
    bool isMatch(string s, string p) {
		int T = s.size(), P = p.size();
		vector<vector<bool>> dp(T + 1, vector<bool>(P + 1));
		dp[T][P] = true;
		for (int i = T; i >= 0; i--) {
			for (int j = P - 1; j >= 0; j--) {
				bool firstMatch = (i < T) && ((s[i] == p[j]) || (p[j] == '.'));
				if ((j + 1 < P) && (p[j + 1] == '*'))
					dp[i][j] = dp[i][j + 2] || (firstMatch && dp[i + 1][j]);
				else
					dp[i][j] = firstMatch && dp[i + 1][j + 1];
			}
		}
		return dp[0][0];
    }
};