LEETCODE: Wildcard Matching

最新推荐文章于 2024-10-04 20:45:38 发布

停止更新+1

最新推荐文章于 2024-10-04 20:45:38 发布

阅读量272

点赞数

文章标签： LEETCODE 算法

本文链接：https://blog.csdn.net/anyicheng2015/article/details/42006377

版权

LEETCODE 专栏收录该内容

153 篇文章 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

算法，本来用递归，但是现在递归已经通不过了。时间复杂度太高了。

下面的方法：

1.如果相同或者是’？‘，那么就跳到下一个。

2.如果是’*‘，记录当前的s和p的位置。

3.如果当前s和p有记录的值，比较记录的p和记录的s之后的所有可能性。

class Solution {
public:
    bool isMatch(const char *s, const char *p) {
        const char *rs = NULL;
        const char *rp = NULL;
        while(*s != '\0') {
            if(*s == *p || *p == '?') { // if is the same, just skip it.
                s ++;
                p ++;
                continue;
            }
            
            if(*p == '*') { // if it is '*', record current positions.
                rs = s;
                rp = p +1;
                p ++;
                continue;
            }
            
            if(rs != NULL) { // if there is '*', using the recorded positions. (rs, rp), (rs + 1, rp), (rs + 2, rp)...
                s = rs;
                p = rp;
                rs ++;
                continue;
            }
            
            return false;
        }
        
        while(*p == '*') p ++;
        
        return *p == '\0';
    }
};