Leetcode's regular Expression Matching (31)

The matching of regular expressions is still very difficult. Depending on whether the next character is * divided into two situations, there are a number of scenarios to consider.

BOOLIsMatch (Const Char*s,Const Char*p) {if(*p = =' /')return*s = =' /'; //if the next is not * (* can represent the number of previous characters)//either the current character matches, or the., cannot be skipped          if(* (P +1) !='*')          {              if(*s = = *p | | (*p = ='.'&& *s! =' /'))                  returnIsMatch (S +1, p +1); Else                  return false; }          Else          {              //if it is *, the current character match | | has one for. //because the back is *, even if not exactly match is OK, skip can               while(*p = = *s | | (*p = ='.'&& *s! =' /'))              {                  if(IsMatch (s, p +2))                      return true; S++; }              returnIsMatch (s, p +2); }      }

View Code

Leetcode's regular Expression Matching (31)