[LeetCode] Wildcard Matching - Iteratively

lyangpku

于 2013-01-29 19:08:32 发布

阅读量712

点赞数

分类专栏： LeetCode 面试题算法回溯文章标签： Leetcode leetcode LeetCode 回溯算法面试题

本文链接：https://blog.csdn.net/lyangpku/article/details/8553776

版权

LeetCode 同时被 3 个专栏收录

110 篇文章 0 订阅

订阅专栏

面试题

110 篇文章 0 订阅

订阅专栏

算法

110 篇文章 0 订阅

订阅专栏

class Solution {
public:
    bool isMatch(const char *s, const char *p) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (!*p) return !*s;
        
        int i = 0;
        int j = 0;
        
        int star = -1;
        int back = -1;
        
        while (s[i]) {
            if (p[j] == '?' || s[i] == p[j]) {
                i++; j++;
            } else if (p[j] == '*') {
                back = i;
                star = j;
                j++;
            } else {
                if (star != -1) {
                    i = back + 1;
                    j = star + 1;
                    back = i;
                } else {
                    return false;
                }
            }
        }
        
        if (!s[i]) {
            while (p[j] == '*')
                j++;
            
            return !p[j];
        }
        
        return false;
    }
};

Small Case: 0ms

Large Case: 76ms

Time: O(m * n)

Space: O(1)