LeetCode [10. Regular Expression Matching]

最新推荐文章于 2024-04-25 11:32:21 发布

爱你多过爱自己

最新推荐文章于 2024-04-25 11:32:21 发布

阅读量154

点赞数

分类专栏： leecode 文章标签： leetcode

本文链接：https://blog.csdn.net/a1042651820/article/details/78761779

版权

leecode 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

Problem

10. Regular Expression Matching

Question

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

Code

class Solution {
public:
    bool isMatch(string s, string p) {
        if (p.size() == 0) return s.size() == 0;

        bool firstmatch = (!s.empty()) && ((s[0] == p[0]) || p[0] == '.');
        if (p.size() > 1 && p[1] == '*') {
            return (isMatch(s, p.substr(2)) || firstmatch && isMatch(s.substr(1), p));
        }
        else
            return firstmatch && isMatch(s.substr(1), p.substr(1));
    }
};