wildcard-matching

最新推荐文章于 2020-11-25 17:32:07 发布

想吃锅包肉哇

最新推荐文章于 2020-11-25 17:32:07 发布

阅读量129

点赞数

分类专栏： Leetcode 文章标签：字符串

本文链接：https://blog.csdn.net/weixin_36909758/article/details/94590021

版权

Leetcode 专栏收录该内容

125 篇文章 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”, "ca*b”) → false

【解题思路】https://www.cnblogs.com/grandyang/p/4401196.html

【考查内容】字符串

class Solution {
public:
    bool isMatch(string s, string p) {
        int i = 0, j = 0, iStar = -1, jStar = -1;
        while (i < s.size()) {
            if (s[i] == p[j] || p[j] == '?') {
                ++i; ++j;
            }else if (p[j] == '*') {
                iStar = i;
                jStar = j++;
            } else if (iStar >= 0) {
                i = ++iStar;
                j = jStar + 1;
            } else return false;
        }
        while (j < p.size() && p[j] == '*') ++j;
        return j == p.size();
    }
};