Wildcard Matching

最新推荐文章于 2020-07-05 09:55:56 发布

撄宁之境

最新推荐文章于 2020-07-05 09:55:56 发布

阅读量441

点赞数

分类专栏： LeetCode 文章标签： LeetCode 算法

本文链接：https://blog.csdn.net/huangynn/article/details/41149057

版权

LeetCode 专栏收录该内容

67 篇文章 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", "c*a*b") → false

如果使用递归会超时，使用两个指针指向上一次匹配的字符

class Solution {
public:
    bool isMatch(const char *s, const char *p) {
       bool star=false;
       const char *prevS=NULL,*prevP=NULL;
       while(*s!='\0'){
           if(*p=='*'){
              star=true;
              prevP=++p;
              prevS=s;
           }
           else{
               if(*p=='?'||*p==*s) {
                   s++;
                   p++;
               }
               else{
                   if(!star) return false;
                   p=prevP;
                   s=prevS++;
               }
           }
       }
       while(*p=='*') p++;
       return *p=='\0';
    }
};