rock c语言实现的带通配符匹配算法

来源:互联网 发布:淘宝怎么录制短视频 编辑:程序博客网 时间:2024/05/29 18:42

‘?’代表任意单个字符,‘*’代表任意0个或多个字符。常用于文件的搜素匹配。


bool MatchWithAsteriskW(wchar_t* str1,wchar_t* pattern)
{
    if(str1 == NULL) returnfalse;
    if(pattern == NULL) returnfalse;
    intlen1 = lstrlenW(str1);
    intlen2 = lstrlenW(pattern);
    intmark = 0;//用于分段标记,'*'分隔的字符串
    intp1 = 0, p2 = 0;
 
    while(p1<len1 && p2<len2)
    {
        if(pattern[p2] == '?')
        {
            p1++;
            p2++;
            continue;
        }
        if(pattern[p2] == '*')
        {
            /*如果当前是*号,则mark前面一部分已经获得匹配,
            *从当前点开始继续下一个块的匹配
            */
            p2++;
            mark = p2;
            continue;
        }
        if(str1[p1] != pattern[p2])
        {
            if(p1 == 0 && p2 == 0)
            {
                /*
                * 如果是首字符,特殊处理,不相同即匹配失败
                */
                returnfalse;
            }
            /*
            * pattern: ...*bdef*...
            *              ^
            *             mark
            *                ^
            *                p2
            *              ^
            *             new p2
            * str1:.....bdcf...
            *             ^
            *             p1
            *            ^
            *          new p1
            * 如上示意图所示,在比到e和c处不想等
            * p2返回到mark处,
            * p1需要返回到下一个位置。
            * 因为*前已经获得匹配,所以mark打标之前的不需要再比较
            */
            p1 -= p2 - mark - 1;
            p2 = mark;
            continue;
        }
        /*
        * 此处处理相等的情况
        */
        p1++;
        p2++;
    }
    if(p2 == len2)
    {
        if(p1 == len1)
        {
            /*
            * 两个字符串都结束了,说明模式匹配成功
            */
            returntrue;
        }
        if(pattern[p2 - 1] == '*')
        {
            /*
            * str1还没有结束,但pattern的最后一个字符是*,所以匹配成功
            *
            */
            returntrue;
        }
    }
    while(p2<len2)
    {
        /*
        * pattern多出的字符只要有一个不是*,匹配失败
        *
        */
        if(pattern[p2] != '*')
            returnfalse;
        p2++;
    }
    returntrue;
}

0 0
原创粉丝点击