2017-09-09 LeetCode_010 Regular Expression Matching

10. Regular Expression Matching

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

solution:

class Solution {

2

public:

3

    bool deep(string & s, string & p, int si, int pi) {

4

        int sl = s.length(), pl = p.length();

5

        if (si == sl && pi == pl) return true;

6

        int sa = -1, pa = -1, pb = -1;

7

        if (si < sl) sa = s[si];

8

        if (pi < pl) pa = p[pi];

9

        if (pi+1 < pl) pb = p[pi+1];

10

        if (pb == '*') {

11

            if (sa == pa || pa == '.' && sa != -1) return deep(s, p, si+1, pi) || deep(s, p, si, pi+2);

12

            return deep(s, p, si, pi+2);

13

        }

14

        if (sa == pa || pa == '.' && sa != -1) return deep(s, p, si+1, pi+1);

15

        return false;

16

    }

17

    bool isMatch(string s, string p) {

18

        return deep(s, p, 0, 0);

19

    }

20

};