C 解法, 执行用时: 1ms, 内存消耗: 308KB, 提交时间: 2021-08-15

#include<stdio.h>
int isCorrect(char ch){
    if(isdigit(ch)||isalpha(ch))return 1;
    else return 0;
}
int compare(char*tem,char*str)
{
    int i=0,j=0,tempi=0,tempj=0,flag=0;
    
    while(j<strlen(str))
    {
        tem[i]=tolower(tem[i]);
        str[j]=tolower(str[j]);
        
        if(tem[i]=='*')
        {
            tempi=i;
            i++;
            flag=1;
            tempj=j;
        }
        else if(tem[i]==str[j]||(tem[i]=='?'&& isCorrect(str[j]))){
            i++;
            j++;
        }
        else if(flag ==1){
            j=++tempj;
            i=tempi;
        }
        else
            return 0;
        
    }
    while(tem[i]=='*'&&tem[i]!='\0')
        i++;
    if(tem[i]==0)
        return 1;
    return 0;
}
int main ()
{
    char comp[500]={0};
    char str[500]={0};
    while(scanf("%s%s",&comp,&str)!=EOF)
    {
        if(compare(comp,str))
            printf("true\n");
        else
            printf("false\n");
    }
}

C 解法, 执行用时: 2ms, 内存消耗: 280KB, 提交时间: 2021-09-04

#include<stdio.h>
#include<string.h>
  
int max(int a, int b)
{
    return a>b?a:b;
}
int match(char a[] ,char b[])
{
    int lena = strlen(a);
    int lenb = strlen(b);
    int dp[100][100] = {0};
    dp[0][0] = 1;
    for(int j = 0;j < lenb;j++)
    {
        if((b[j] == '.') || ((b[j] >= '0') && (b[j] <= '9')) || ((b[j] >= 'a') && (b[j] <= 'z')) || ((b[j] >= 'A') && (b[j] <= 'Z')))
        {
            continue;
        }
        else
        {
            return 0;
        }
    }
    for(int i = 1;i <= lena;i++)
    {
        if(a[i - 1] == '*')
        {
            dp[i][0] = 1;
        }
        else
        {
            break;
        }
    }
    for(int i = 1;i <= lena;i++)
    {
        for(int j = 1;j <= lenb;j++)
        {
            if(a[i - 1] == '?')
            {
                dp[i][j] = max(dp[i][j] , dp[i-1][j-1]);
            }
            if((a[i - 1] == b[j - 1]) || (a[i - 1] == b[j - 1] + 32) || (a[i - 1] == b[j - 1] - 32))
            {
                dp[i][j] = max(dp[i][j] , dp[i-1][j-1]);
            }
            if(a[i - 1] == '*')
            {
                dp[i][j] = max(dp[i][j] , (dp[i-1][j] || dp[i][j - 1]));
            }
        }
    }
    return dp[lena][lenb];
      
}
  
int main()
{
    int m;
    char a[100],b[100];
    while(scanf("%s",&a) != EOF)
    {
        scanf("%s",&b) ;
        m = match(a, b);
         if(m == 1)
    {
        printf("true\n");
    }
    else{
        printf("false\n");
    }
    }
}