wildcard-matching

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

llwjason5555

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

阅读量205

点赞数

分类专栏： leetcode 文章标签： leetcode 动态规划

本文链接：https://blog.csdn.net/llwjason5555/article/details/77969898

版权

leetcode 专栏收录该内容

116 篇文章 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)
   {
          int ls = strlen(s), lp = strlen(p);
          vector<vector<bool> > vvb(ls + 1, vector<bool>(lp + 1, false));
          vvb[0][0] = true;

         for(int j = 1; j <= lp; ++ j)
         {
             vvb[0][j] = vvb[0][j - 1] && '*' == p[j - 1];
             for(int i = 1; i <= ls; ++ i)
             {
                 if('?' == p[j - 1] || s[i - 1] == p[j - 1])
                     vvb[i][j] = vvb[i - 1][j - 1];
                 else if('*' == p[j - 1])
                     vvb[i][j] = vvb[i][j - 1] || vvb[i - 1][j];
             }
         }

         return vvb[ls][lp];
     }
};