LeetCode 10. Regular Expression Matching

10. 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

Approach

题目大意：字符串模式匹配，缩小版的正则表达式，‘.’可以匹配任意一个字符，‘*’可以让前一个字符重复任意次包括零次，模式匹配一般都是用回溯解决，数据量大的话，需要适当剪枝。

Code

class Solution {
public:
    bool isMatch(string s, string p) {
        les = s.size(), lep = p.size();
        vector<vector<int>> cache(les + 1, vector<int>(lep + 1, -1));
        return ismath(s, 0, p, 0, cache);
    }

private:
    unsigned long les = 0, lep = 0;

    bool ismath(const string &s, int i, const string &p, int j, vector<vector<int>> &cache) {
        if (i == les && j == lep)return true;
        if (j == lep)return false;
        if (cache[i][j] != -1)return cache[i][j] == 1;
        if (j + 1 < lep && p[j + 1] == '*') {
            if (p[j] == '.' || (i < les && p[j] == s[i])) {
                cache[i][j] = ismath(s, i, p, j + 2, cache) || (i < les && ismath(s, i + 1, p, j + 2, cache)) ||
                              (i < les && ismath(s, i + 1, p, j, cache));
            } else {
                cache[i][j] = ismath(s, i, p, j + 2, cache);
            }
        } else if (i < les && (p[j] == '.' || p[j] == s[i])) {
            cache[i][j] = ismath(s, i + 1, p, j + 1, cache);
        }
        return cache[i][j] == 1;
    }
};