LeetCode-Regular Expression Matching

最新推荐文章于 2022-05-01 16:20:00 发布

所难

最新推荐文章于 2022-05-01 16:20:00 发布

阅读量665

点赞数

分类专栏： Level 1 Cracking LeetCode String 文章标签： leetcode Regular Expression M

本文链接：https://blog.csdn.net/HolyDominat/article/details/38665135

版权

Cracking LeetCode 同时被 3 个专栏收录

152 篇文章 0 订阅

订阅专栏

Level 1

18 篇文章 0 订阅

订阅专栏

String

16 篇文章 0 订阅

订阅专栏

Implement regular expression matching with support for '.' and '*'.

'.' Matches any single character.
'*' Matches zero or more of the preceding element.

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", "a*") → true
isMatch("aa", ".*") → true
isMatch("ab", ".*") → true
isMatch("aab", "c*a*b") → true

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
    bool isMatch(const char *s, const char *p) {
        if (*s == '\0' && *p == '\0') return true;
        if (*s != '\0' && *p == '\0') return false;
        if (*(p+1) == '*') {
            while (*s != '\0' && (*s == *p || *p == '.')) {
                if (isMatch(s, p+2))
                    return true;
                ++s;
            }
            return isMatch(s, p+2);
        } else {
            if (*s != '\0' && (*s == *p || *p == '.')) return isMatch(s+1, p+1);
        }
        return false;
    }
};</span>