class Solution {
 public:
 bool isMatch(string s, string p) {
 unordered_set preDp;
 preDp.insert(0);
 for (const auto& ch : p )
 { 
 unordered_set dp;
 if (‘*’ == ch)
 {
 int iMin = *std::min_element(preDp.begin(), preDp.end());
 for (; iMin <= s.length(); iMin++)
 {
 dp.insert(iMin);
 }
 }
 else
 {
 for (const auto& pre : preDp)
 {
 if (pre < s.length())
 {
 if ((‘?’ == ch) || (ch == s[pre]))
 {
 dp.insert(pre + 1);
 }
 }
 }
 }preDp.swap(dp);
		 if (preDp.empty())
		 {
			 return false;
		 }
	 }
	 return *std::max_element(preDp.begin(),preDp.end()) >= s.length();
 }};

class Solution {
 public:
 bool isMatch(string s, string p) {
 if (p.empty())
 {
 return s.empty();
 }
 vector vp;
 int left = 0;
 for (int i = 0; i < p.length()😉
 {
 while ((i < p.length()) && (‘’ != p[i]))
 {
 i++;
 }
 //p[i]为’\0’或
 vp.emplace_back(p.substr(left, i - left));
 while ((i < p.length()) && (’’ == p[i]))
 {
 i++;
 }
 left = i;
 }
 if ('’ == p.back())
 {
 vp.emplace_back(“”);
 }
 if (1 == vp.size())
 {
 return (s.length()p.length())&& (0Cmp(s,p));
 }
 const int iFirstLen = vp.front().length();
 if (s.length() < iFirstLen)
 {
 return false;
 }
 if (0 != Cmp( s, vp.front()))
 {
 return false;
 }
 s = s.substr(iFirstLen);
 vp.erase(vp.begin(), vp.begin()+1);const int iRemain = s.length() - vp.back().length();
	if (iRemain < 0)
	{
		return false;
	}
	if (0 != Cmp(s.substr(iRemain), vp.back()))
	{
		return false;
	}
	s = s.substr(0, iRemain);
	vp.pop_back();

	for (const auto& subP : vp)
	{
		const int ind = Cmp(s, subP);
		if (-1 == ind)
		{
			return false;
		}
		s = s.substr(ind + subP.length());
	}
	return true;
}

int Cmp( const string& s , const string& strP)
{
	int len = strP.length();
	for (int i = 0; i+len <= s.length(); i++)
	{
		if (CmpInner(s, i, strP))
		{
			return i;
		}
	}		
	return -1;
}
bool CmpInner(const string& s,int si, const string& strP)
{
	int len = strP.length();
	for (int i = 0; i < len; i++)
	{
		if ((s[i+si] != strP[i]) && ('?' != strP[i]))
		{
			return false;
		}
	}
	return true;
}};