LeetCode_44 Wildcard Matching

最新推荐文章于 2024-10-03 23:42:25 发布

sbicode

最新推荐文章于 2024-10-03 23:42:25 发布

阅读量207

点赞数

分类专栏： backtracking backward 文章标签： leetcode

本文链接：https://blog.csdn.net/sbicode/article/details/50604780

版权

backtracking 同时被 2 个专栏收录

13 篇文章 0 订阅

订阅专栏

backward

1 篇文章 0 订阅

订阅专栏

Link to original problem: 这里写链接内容

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

Related problems:
10 Regular Expression Matching 这里写链接内容

I tried the basic backtracking (recursion) method and the method which has optimization on continuous ‘*’, for this problem and get TLE twice. So I came up with the idea dealing with this problem from the tail of those two string.

public class Solution {
    public boolean isMatch(String s, String p) {
        if(p.length() == 0) return (s.length() == 0);
        if(p.charAt(0) == '*'){
            if(s.length() == 0) return isMatch(s, p.substring(1));
            else return isMatch(s, p.substring(1)) || isMatch(s.substring(1), p);
        }
        else{
            if(s.length() == 0) return false;
            else if(s.charAt(0) == p.charAt(0) || p.charAt(0) == '?') return isMatch(s.substring(1), p.substring(1));
            else return false;
        }
    }
}

This code failed on:
“aaabbbaabaaaaababaabaaabbabbbbbbbbaabababbabbbaaaaba”
“a*******b”

public class Solution {
    public boolean isMatch(String s, String p) {
        if(p.length() == 0) return (s.length() == 0);
        if(p.charAt(0) == '*'){
            if(s.length() == 0) return isMatch(s, p.substring(1));
            else if(p.length() > 1 && p.charAt(1) == '*') return isMatch(s, p.substring(1));
            else return isMatch(s, p.substring(1)) || isMatch(s.substring(1), p);
        }
        else{
            if(s.length() == 0) return false;
            else if(s.charAt(0) == p.charAt(0) || p.charAt(0) == '?') return isMatch(s.substring(1), p.substring(1));
            else return false;
        }
    }
}

And this code failed on:
“babbbbaabababaabbababaababaabbaabababbaaababbababaaaaaabbabaaaabababbabbababbbaaaababbbabbbbbbbbbbaabbb”
“b**bb**a**bba*b**a*bbb**aba***babbb*aa****aabb*bbb***a”