leetcode - Regular Expression Matching

AkibaTakuya

于 2014-10-25 19:33:26 发布

阅读量424

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/AkibaTakuya/article/details/40455617

版权

leetcode 专栏收录该内容

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

class Solution {
public:
    bool isMatch(const char *s, const char *p) {
        for(char c = *p; c != 0; ++s, c = *p) {
            if(*(p+1) != '*')
                p++;
            else if(isMatch( s, p+2))
                return true;
            if((*s==0) || ((c!='.') && (c!=*s)))
                return false;
        }
        return *s == 0;
    }
};