通配符字符串匹配

利用递归，实现了通配符？和* 的字符串匹配 判断

代码中为了不区分大小写，使用tolower函数。

如果要区分大小写，去掉tolower就好。

bool match(const char *pattern, const char *content)
{
 // if we reatch both end of two string, we are done  
    if ('\0' == *pattern && '\0' == *content) 
        return true; 
    /* make sure that the characters after '*' are present in second string.
      this function assumes that the first string will not contain two
       consecutive '*'*/ 
    if ('*' == *pattern && '\0' != *(pattern + 1) && '\0' == *content) 
        return false; 
    // if the first string contains '?', or current characters of both   
    // strings match  
    if ('?' == *pattern || tolower(*pattern) == tolower(*content))  //不区分大小写
        return match(pattern + 1, content + 1); 
    /* if there is *, then there are two possibilities
       a) We consider current character of second string
       b) We ignore current character of second string.*/ 
    if ('*' == *pattern) 
        return match(pattern + 1, content) || match(pattern, content + 1); 
    return false; 
}

函数：

bool isMatching(const char *pattern, const char *content)
{
    if (NULL == pattern || NULL == content) 
	return false; 
    return match(pattern, content);
}

测试：

bool isOk = isMatching("g*ks", "geeks");
cout << "g*ks and geeks :" << isOk << endl;

isOk = isMatching("ge?ks*", "geeksforgeeks");
cout << "ge?ks* and geeksforgeeks :" << isOk << endl;

isOk = isMatching("g*k", "gee");
cout << "g*k and gee :" << isOk << endl;

isOk = isMatching("*pqrs", "pqrst");
cout << "*pqrs and pqrst:" << isOk << endl;

isOk = isMatching("abc*bcd", "abcdhghgbcd");
cout << "abc*bcd and abcdhghgbc :" << isOk << endl;

isOk = isMatching("abc*bcd", "abcdhghgbcd");
cout << "abc*bcd and abcdhghgbc :" << isOk << endl;

isOk = isMatching("abc*c?d", "abcd");
cout << "abc*c?d and abcd :" << isOk << endl;

isOk = isMatching("*c*d", "abcd");
cout << "*c*d and abcd :" << isOk << endl;

isOk = isMatching("*?c*d", "abcd");
cout << "*?c*d and abcd :" << isOk << endl;

运行结果如下：