[LeetCode] (hard) 10. Regular Expression Matching && 44. Wildcard Matching

10. Regular Expression Matching

Given an input string (s) and a pattern (p), 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 entireinput 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 = "c*a*b"
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 = "mis*is*p*."
Output: false

44. Wildcard Matching

Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*'.

'?' Matches any single character.
'*' Matches any sequence of characters (including the empty sequence).

The matching should cover the entireinput 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 = "*"
Output: true
Explanation: '*' matches any sequence.

Example 3:

Input:
s = "cb"
p = "?a"
Output: false
Explanation: '?' matches 'c', but the second letter is 'a', which does not match 'b'.

Example 4:

Input:
s = "adceb"
p = "*a*b"
Output: true
Explanation: The first '*' matches the empty sequence, while the second '*' matches the substring "dce".

Example 5:

Input:
s = "acdcb"
p = "a*c?b"
Output: false

---

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

 

class Solution {
public:
    bool isMatch(string s, string p) {
        int idx_s = 0, idx_p = 0;
        int pre_s = -1, pre_p = -1;
        while(idx_s < s.size()){
            if(idx_p < p.size() && (s[idx_s] == p[idx_p] || p[idx_p] == '?')){
                ++idx_s;
                ++idx_p;
            }else if(idx_p < p.size() && p[idx_p] == '*'){
                pre_s = idx_s;
                pre_p = idx_p;
                ++idx_p;
            }else if(pre_p != -1){
                idx_p = pre_p;
                idx_s = pre_s+1;
            }else{
                return false;
            }
        }
        
        while(idx_p < p.size() && p[idx_p] == '*') ++idx_p;
        return idx_p == p.size();
    }
};

---

后者之所以能用更快速的方法完成在于不同位置出现的星号的功能相同，因此后出现的星号对先出现的星号具有覆盖作用，例如：

 s:[头]+[xx]+[匹配段1]+[xx]+[匹配段1]+[xx]+[匹配段2]+[尾]

p:[头]+[*]+[匹配段1]+[*]+[匹配段2]

p中匹配段1匹配到s中的哪个匹配段并不重要，所以在第二个星号被读到之后，第一个星号的信息就可以抛弃了，自然也不需要回溯（相当于s中真正被p中匹配段1匹配的段可以在一堆任意字符中左右滑动）

而前者没有这个性质