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
c++:

class Solution {
public:
    bool isMatch(const char *s, const char *p) {
        const char *sp = NULL;
        const char *ss = NULL;
        while(*s)
        {
            if(*p == *s || *p == '?')
            {
                p ++;
                s ++;
                continue;
            }
            if(*p == '*')
            {
                sp = p;
                ss = s;
                p++;
                continue;
            }
            if(sp != NULL)
            {
                p = sp + 1;
                s = ss + 1;
                ss ++;
                continue;
            }
            return false;
        }
        while(*p == '*')
        {
            p ++;
        }
        return *p == '\0';
    }
};


  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值