"Leetcode" Regular Expression Matching

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") →falseismatch ( "AA", "AA") →trueismatch ("AAA", "AA") →falseismatch ("AA", "A *") →trueismatch ("AA", ". *") →trueismatch ("AB", ". *") →true IsMatch ("AaB", "C*a*b") →true

1 classSolution {2  Public:3     BOOLIsMatch (Const Char*s,Const Char*p) {4        5         if(s==null| | P==null)return false;6         if(*p==' /'&&*s==' /')return true;7         if(*p==' /'&&*s!=' /')return false;8      9         //if the next character of a pattern string is *Ten         if(* (p+1)=='*') One         { A             //loops to compare whether the current character is equal to the pattern string character -              while((*s!=' /'&&*p=='.')|| (*s==*p)) -             { the                 //prevent this from happening: "AAA", "A*a" -                 if(IsMatch (s,p+2))return true; -s++; -             } +             returnIsMatch (s,p+2); -         } +         Else if((*s!=' /'&&*p=='.')|| *s==*p) A         { at             //starts matching the next element if the current element is equal -             returnIsMatch (s+1, p+1); -         } -         return false; -     } -};

"Leetcode" Regular Expression Matching