LeetCode-Wildcard Matching

最新推荐文章于 2020-06-12 21:55:50 发布

所难

最新推荐文章于 2020-06-12 21:55:50 发布

阅读量310

点赞数

CC 4.0 BY-SA版权

分类专栏： Cracking LeetCode Math Game 文章标签： leetcode Wildcard Matching

本文链接：https://blog.youkuaiyun.com/HolyDominat/article/details/38583927

Cracking LeetCode 同时被 2 个专栏收录

152 篇文章

订阅专栏

Math Game

50 篇文章

订阅专栏

本文介绍了一种实现通配符匹配的算法，支持 '?' 和 '*' 两种通配符。其中 '?' 匹配任意单个字符，'*' 匹配任意序列的字符。文章详细解析了该算法的工作原理，并给出了具体的 C++ 实现代码。通过几个实例演示了如何使用该算法进行字符串匹配。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
    bool isMatch(const char *s, const char *p) {
        int indexS = 0, indexP = 0, preS = -1, preP = -1;
        while (s[indexS] != '\0') {
            if (s[indexS] == p[indexP] || p[indexP] == '?') {
                ++indexS;
                ++indexP;
                continue;
            }
            if (p[indexP] == '*') {
                preS = indexS;
                preP = indexP;
                ++indexP;
                continue;
            }
            if (preP != -1) {
                ++preS;
                indexS = preS;
                indexP = preP+1;
                continue;
            }
            return false;
        }
        while (p[indexP] != '\0' && p[indexP] == '*') ++indexP;
        return p[indexP] == '\0';
    }
};</span>