leetcode - Regular Expression Matching

来源:互联网 发布:apache怎么读 编辑:程序博客网 时间:2024/03/29 10:28

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") → falseisMatch("aa","aa") → trueisMatch("aaa","aa") → falseisMatch("aa", "a*") → trueisMatch("aa", ".*") → trueisMatch("ab", ".*") → trueisMatch("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;    }};


0 0