010Regular Expression Matching__leetcode

'.' 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", ".*") → trueisMatch("aab", "c*a*b") → true

這道Regex匹配，我分別按照不同的條件來設定if語句，在提交的時候，因為.*匹配問題沒有通過，現在先將代碼放上，以後再修改

bool isMatch(char* s,char* p){    int i=0,j=0;    if(p[i]!='.'&&p[i]!=s[j]){    return false;    }    i++;    j++;while(s[j]!='\0'&&p[i]!='\0'){if(p[i]=='.'||p[i]==s[j]){i++;j++;}else if(p[i]=='*'){if(p[i-1]=='.'){return true;}else if(p[i-1]=='*'){//}else{if(s[j]==p[i]){j++;while(s[j]==s[j-1]){j++;}}i++;}}else{return false;}}if(s[j]=='\0'){return true;}else{return false;} }