Codeforces Round #504 A. Single Wildcard Pattern Matching(思维)

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int n,m;
string str1,str2;

int main()
{
	scanf("%d%d",&n,&m);
	cin>>str1>>str2;
	int flag = -1;
	for(int i=0;i<n;i++){
		if(str1[i] == '*')flag = i;
	}
	if(flag == -1 && str1 == str2){
		puts("YES");
		return 0;
	}
	if(flag == -1 || m < n - 1){
		puts("NO");
		return 0;
	}
	for(int i=0;i<flag;i++){
		if(str1[i] != str2[i]){
			puts("NO");
			return 0;
		}
	}
	for(int i=n-1,j=m-1;i>flag;i--,j--){
		if(str1[i] != str2[j]){
			puts("NO");
			return 0;
		}
	}
	puts("YES");
	return 0;
}