單函數實現通配符算法

由於項目原因要實現"通配符匹配"，看別人的算法，都是要2到3個函數來實現，一個爲最初調用，一個爲星號處理。能不能一函數就搞定呢？以下的算法只用一個函數實現同樣的功能。寫得不當地方，請多多指教。呵呵。

 

#include <stdio.h> #ifndef FALSE #define FALSE 0 #endif #ifndef TRUE #define TRUE 1 #endif #ifndef OK #define OK 0 #endif #ifndef ERROR #define ERROR -1 #endif #define WC_MATCH_YES 0 #define WC_MATCH_NO 1 #define WC_MATCH_ERROR -1 /* * wildcard match * * @text text to match * @wildcard wildcard string * @flag loop flag * * mark: just match wildcard '*' and '?'. */ int match_text(const char *text, const char *wildcard, int flag) { if( NULL == text || NULL == wildcard ){ return WC_MATCH_ERROR; } if( '/0' == *text && '/0' == *wildcard ){ return WC_MATCH_YES; } if( TRUE == flag ){ // no loop int ret = match_text(text, wildcard, FALSE); return ( ret == WC_MATCH_YES ) ? WC_MATCH_YES : match_text(text+1, wildcard, TRUE); } if( ('/0' == *text && '/0' != *wildcard && '*' != *wildcard) || ('/0' != *text && '/0' == *wildcard) ){ return WC_MATCH_NO; } switch(*wildcard){ case '*': return match_text(text, wildcard+1, TRUE); case '?': return match_text(text+1, wildcard+1, FALSE); default: if( *text == *wildcard ){ return match_text(text+1, wildcard+1, FALSE); }else{ return WC_MATCH_NO; } } } typedef struct { char *text; char *wildcard; }mystruct; mystruct array[] = { { "", "*" }, { "wuyao", "*" }, { "wuyao", "wu*" }, { "wuyao", "*ao" }, { "wuyao", "*wuyao*" }, { "wuyao", "w*a*o" }, { "wuyao", "w*ya*o" }, { "wuyao", "?????" }, { "wuyao", "????" }, { "wuyao", "????o" }, { "wuyao", "?*??o" }, { "wuyao", "uya*o" }, { "wuyao", "wuyaoo*" }, { "wuyao", "wya*o" }, }; int main() { int i; for( i = 0; i < sizeof(array)/sizeof(array[0]); i++){ if( OK == match_text(array[i].text, array[i].wildcard, FALSE) ){ printf("text: %s; wildcard: %s; result: OK/n", array[i].text, array[i].wildcard); }else{ printf("text: %s; wildcard: %s; result: ERROR/n", array[i].text, array[i].wildcard); } } }