121_leetcode_Wildcard Matching

最新推荐文章于 2024-10-20 15:47:10 发布

ezzffzz

最新推荐文章于 2024-10-20 15:47:10 发布

阅读量293

点赞数

分类专栏：算法 leetcode 编程文章标签： leetcode 算法编程语言面试

本文链接：https://blog.csdn.net/ezzffzz/article/details/35979141

版权

算法同时被 3 个专栏收录

155 篇文章 0 订阅

订阅专栏

leetcode

155 篇文章 0 订阅

订阅专栏

编程

155 篇文章 0 订阅

订阅专栏

Implement wildcard pattern matching with support for '?' and '*'.

'?' Matches any single character.
'*' Matches any sequence of characters (including the empty sequence).

The matching should cover the entire input string (not partial).

The function prototype should be:
bool isMatch(const char *s, const char *p)

Some examples:
isMatch("aa","a") → false
isMatch("aa","aa") → true
isMatch("aaa","aa") → false
isMatch("aa", "*") → true
isMatch("aa", "a*") → true
isMatch("ab", "?*") → true
isMatch("aab", "c*a*b") → false

1:注意特殊情况；2:遇到‘？'，分别＋＋；3:遇到‘＊’的情况

    bool isMatch(const char *s, const char *p)
    {
        if(s == NULL || p == NULL)
        {
            return false;
        }
        
        bool flag = false;
        const char* indexP = nullptr;
        const char* indexS = nullptr;
        
        while( *s != '\0')
        {
            if(*p == '?')
            {
                p++;
                s++;
            }
            else if(*p == '*')
            {
                while(*p == '*')
                {
                    p++;
                }
                p--;
                
                indexP = p;
                indexS = s;
                flag = true;
                p++;
            }
            else
            {
                if(*p == *s)
                {
                    p++;
                    s++;
                }
                else
                {
                    if(flag == true)
                    {
                        p = indexP + 1;
                        s = ++indexS;
                    }
                    else
                    {
                        return false;
                    }
                }
            }
        }
        
        while(*p == '*')
        {
            p++;
        }
        
        if(*s == '\0' && *p == '\0')
        {
            return true;
        }
        else
        {
            return false;
        }
        
    }