class Solution {
public:bool isMatch(string s, string p) {return backTracking(s,p,0,0);}bool backTracking(string s, string p, int sp, int pp){//end conditionif(sp==s.length()){while(pp<p.length() &&p[pp]=='*' ){pp++;}if(pp == p.length()) return true;else return false;}if(pp==p.length()) return false;if(p[pp]=='*'){while(pp+1<p.length() && p[pp+1]=='*') pp++; //ignore the stars directly behind starif(backTracking(s,p,sp,pp+1)) return true; //* not repeatsreturn backTracking(s,p,sp+1,pp); //* repeats
        }else if(s[sp]==p[pp] || p[pp]=='?') return backTracking(s,p,sp+1,pp+1);else return false;}
};

class Solution {
public:bool isMatch(string s, string p) {star = false;return recursiveCheck(s,p,0,0);}bool recursiveCheck(const string &s, const string &p, int sIndex, int pIndex){if(sIndex >= s.length()){while(p[pIndex] == '*' && pIndex < p.length()) pIndex++; //s has went to end, check if the rest of p are all *return (pIndex==p.length());}if(pIndex >= p.length()){return checkStar(s,p);}switch(p[pIndex]) //p: pattern，在p中才可能出现?, *
        { case '?':return recursiveCheck(s, p, sIndex+1, pIndex+1);break;case '*': //如果当前为*， 那么可认为之前的字符都匹配上了，并且将p移动到 * 结束后的第一个字符star = true;  //p 每次指向的位置，要么是最开始，要么是 * 结束的第一个位置starIndex = pIndex;matchedIndex = sIndex-1;while(p[pIndex] == '*'&& pIndex < p.length()){pIndex++;} //忽略紧接在 *后面的* if(pIndex==p.length()) return true;//最后一位是*return recursiveCheck(s,p,sIndex,pIndex); //*匹配0个字符break;default:if(s[sIndex] != p[pIndex]) return checkStar(s, p);else return recursiveCheck(s, p, sIndex+1, pIndex+1);break;}}bool checkStar(const string &s, const string &p){if(!star) return false;else {int pIndex = starIndex+1;int sIndex = ++matchedIndex; //回溯，*d多匹配一个字符return recursiveCheck(s, p, sIndex, pIndex);}}
private:int starIndex;int matchedIndex;bool star;
};

class Solution {
public:bool isMatch(string s, string p) {int sLen = s.length();int pLen = p.length();if(sLen == 0){int pp = 0;while(pp<p.length() &&p[pp]=='*' ){pp++;}if(pp == p.length()) return true;else return false;}if(pLen == 0) return false;int len = 0;for(int i = 0;i < pLen;i++)  if(p[i] != '*') len++;  if(len > sLen) return false; bool dp[sLen][pLen];int i = 0, j = 0;for(;i<sLen;i++){for(;j<pLen;j++){dp[i][j]=false;}}if(p[0]=='*'){ //c;*?*for(i = 0;i < sLen; i++ ){dp[i][0] = true;}}//first line can appear one letter which is not starif (p[0]=='?' || s[0] == p[0]){ //first not-star-letter appearsdp[0][0] = true;for(j = 1;(j < pLen && p[j]=='*'); j++ ){dp[0][j]=true;}} else if(p[0]=='*'){ for(j = 1;(j < pLen && p[j-1]=='*'); j++ ){if(p[j]=='?' || s[0] == p[j]){ //first not-star-letter appearsdp[0][j]=true;j++;for(;j<pLen && p[j]=='*'; j++){ //after first not star, there should be all stardp[0][j]=true;}break;}else if(p[j]=='*'){dp[0][j]=true;}}}for(i = 1; i < sLen; i++){for(j = 1; j < pLen; j++){if(p[j]=='*'){dp[i][j] = dp[i-1][j] //* repeat 1 time|| dp[i][j-1]; //*repeat 0 times
                }else if(s[i]==p[j] || p[j]=='?'){dp[i][j] = dp[i-1][j-1];}}}return dp[sLen-1][pLen-1];}
};

class Solution {
public:bool isMatch(string s, string p) {int sLen = s.length();int pLen = p.length();if(sLen == 0){int pp = 0;while(pp<p.length() &&p[pp]=='*' ){pp++;}if(pp == p.length()) return true;else return false;}if(pLen == 0) return false;vector<vector<bool>> dp(sLen+1, vector<bool>(pLen+1,0));//initial statesint i = 0, j = 0;dp[0][0]=true;for(j = 1;(j <= pLen && p[j-1]=='*'); j++ ){dp[0][j]=true;}//state transferfor(i = 1; i <= sLen; i++){for(j = 1; j <= pLen; j++){if(p[j-1]=='*'){dp[i][j] = dp[i-1][j] //* repeat 1 time|| dp[i][j-1]; //*repeat 0 times
                }else if(s[i-1]==p[j-1] || p[j-1]=='?'){dp[i][j] = dp[i-1][j-1];}}}return dp[sLen][pLen];}
};

class Solution {
public:bool isMatch(string s, string p) {int sLen = s.length();int pLen = p.length();if(sLen == 0){int pp = 0;while(pp<p.length() &&p[pp]=='*' ){pp++;}if(pp == p.length()) return true;else return false;}if(pLen == 0) return false;vector<bool> lastDP(pLen+1, 0);vector<bool> currentDP(pLen+1, 0);vector<bool> tmp;//initial statesint i = 0, j = 0;lastDP[0]=true;for(j = 1;(j <= pLen && p[j-1]=='*'); j++ ){lastDP[j]=true;}//state transferfor(i = 1; i <= sLen; i++){currentDP[0]=false;for(j = 1; j <= pLen; j++){if(p[j-1]=='*'){currentDP[j] = lastDP[j] //* repeat 1 time|| currentDP[j-1]; //*repeat 0 times
                }else if(s[i-1]==p[j-1] || p[j-1]=='?'){currentDP[j] = lastDP[j-1];}else{currentDP[j] = false;}}tmp = currentDP;currentDP = lastDP;lastDP = tmp;}return lastDP[pLen];}
};