首页 > itarticle > leetcode (33) wildcard matching

leetcode (33) wildcard matching

admin 11月 12, 2020 0

Leetcode 44. Wildcard Matching

Leetcode Matrix Series

Leetcode 44. Wildcard Matching

Leetcode 44. Wildcard Matching

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
`

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