10、Regular Expression Matching

最新推荐文章于 2021-05-30 20:05:56 发布

原创最新推荐文章于 2021-05-30 20:05:56 发布 · 228 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

leetcode

本文详细介绍了如何实现支持点和星号操作的正则表达式匹配函数，包括Python和C++版本的实现，并提供了多个示例进行验证。

题目：

mplement 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

解题思路：

python版本：

class Solution(object):
    def isMatch(self, s, p):
        """
        :type s: str
        :type p: str
        :rtype: bool
        """
        return re.match('^' + p + '$', s)!=None

c++版本：

class Solution {
public:
    bool isMatch(string s, string p) {
        // both s and p reach their ends
        if ( p.empty() ) return s.empty();
        // p's next is not *
        if ( p[1]!='*' )
        {
            return ( s[0]==p[0] || (p[0]=='.' && !s.empty()) ) && Solution::isMatch(s.substr(1), p.substr(1));
        }
        // p's next is * and curr s match curr p
        int i = 0;
        for ( ; s[i]==p[0] || (p[0]=='.' && i<s.size()); ++i)
        {
            if ( Solution::isMatch(s.substr(i), p.substr(2)) ) return true; 
        }
        // p's next is * but curr s not match curr p
        return Solution::isMatch(s.substr(i), p.substr(2));
    
    }
};