leetcode - Wildcard Matching

Posted ljbguanli

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了leetcode - 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", "c*a*b") → false

class Solution {
public:
    bool isMatch(const char *s, const char *p) {
        const char* star=NULL;
        const char* t=s;
        while (*s)
		{
            if ((*p==‘?

‘)||(*p==*s)) { s++; p++; continue; } if (*p==‘*‘) { star=p++; t=s; continue; } if (star) { p = star+1; s=++t; continue; } return false; } while (*p == ‘*‘) { p++; } return !*p; } };





以上是关于leetcode - Wildcard Matching的主要内容,如果未能解决你的问题,请参考以下文章

leetcode-44. Wildcard Matching

[动态规划] leetcode 44 Wildcard Matching

Wildcard Matching leetcode java

leetcode - Wildcard Matching

[LeetCode] Wildcard Matching

leetcode 44. Wildcard Matching