Regular Expression Matching 正则表达式匹配

class Solution { public: bool isMatch(const char *s,const char *p) { if(*p=='\0') return *s=='\0'; if(*(p+1)!='*') { if(*s==*p||*p=='.'&&*s!='\0') { return isMatch(s+1,p+1); } else return false; } else { while(*s==*p||*p=='.'&&*s!='\0') { if(isMatch(s,p+2)) return true; s++; //pass as more as possible } return isMatch(s,p+2);//pass zero } } };