LeetCode-10：Regular Expression Matching

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

题目翻译：

给定一个字符串 (s) 和一个字符模式 §。实现支持 ‘.’ 和 ‘*’ 的正则表达式匹配。

‘.’ 匹配任意单个字符

‘*’ 匹配零个或多个前面的那一个元素

---

二、解题方案

思路：

回溯法:（设s(i)表示串s从位置i开始的后缀。p(j)同理）

1.当s为空串时，此时p为空串，匹配成功。

2.当p为空时，此时s不为空，匹配失败。

3.如果s和p的第一个字符匹配时，即s[0] == p[0] 或 p[0] == ‘.’时，要对除第一个字符外的s(1)和p(1)递归匹配。

4.当p[1] == ‘*’

5.其它情况，匹配失败。

代码实现：

class Solution {
public:
    bool isMatch(string s, string p) {
      if(s.empty()) return p.empty() || p.size() >= 2 && p[1] == '*' && dfs(s,p.substr(2));
        if(p.empty()) return false;
        if(s[0] == p[0] || p[0] == '.') {
            bool r = dfs(s.substr(1),p.substr(1));
            if(r) return true;
        }
        if(!(p.size() >= 2 && p[1] == '*')) return false;
        bool r = dfs(s,p.substr(2));
        if(r) return true;
        for(int c=0;c<s.size();++c){
            if(s[c] == p[0] || p[0] == '.') {
                bool r = dfs(s.substr(c+1),p.substr(2));
                if(r) return true;
            }else break;
        }

        return false;
    }
};