10. Regular Expression Matching

原网址为https://leetcode.com/problems/regular-expression-matching/description/

一、题目

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

The function prototype should be:
bool isMatch(const char *s, const char *p)

Some examples:
isMatch("aa","a") → false
isMatch("aa","aa") → true
isMatch("aaa","aa") → false
isMatch("aa", "a*") → true
isMatch("aa", ".*") → true
isMatch("ab", ".*") → true
isMatch("aab", "c*a*b") → true

二、代码

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