lintcode:Wildcard Matching

504 篇文章 0 订阅
66 篇文章 0 订阅

mplement 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)


Example

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:
    /**
     * @param s: A string 
     * @param p: A string includes "?" and "*"
     * @return: A boolean
     */
    bool isMatch(const char *s, const char *p) {
        // write your code here
        
        int s_size = strlen(s);
        int p_size = strlen(p);
        
        vector<vector<bool> > dp(s_size+1, vector<bool>(p_size+1));
        
        dp[0][0] = 1;
        
        for (int i=1; i<=s_size; i++)
        {
            for (int j=1; j<=p_size; j++)
            {
                if (dp[i-1][j-1])
                {
                    if (s[i-1] == p[j-1])
                    {
                        dp[i][j] = true;
                    }
                    else if (p[j-1] == '?' || p[j-1] == '*')
                    {
                        dp[i][j] = true;
                    }
                }
                else if (dp[i-1][j])
                {
                    if (p[j-1] == '*')
                    {
                        dp[i][j] = true;
                    }
                }
            }
        }
        
        return dp[s_size][p_size];
    }
};


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值