码迷,mamicode.com
首页 > 其他好文 > 详细

#10 Regular Expression Matching

时间:2015-04-11 20:41:45      阅读:114      评论:0      收藏: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){
        if (s == NULL || p == NULL) return false;
        if (*p == \0) return *s == \0;

        if (*(p + 1) == *){
            while ((*s != \0 && *p == .) || *s == *p){
                if (isMatch(s, p + 2)) 
                    return true;
                ++s;
            }
            return isMatch(s, p + 2);
        }
        else if ((*s != \0 && *p == .) || *s == *p){
            return isMatch(s + 1, p + 1);
        }
        return false;
    }
};

 

#10 Regular Expression Matching

标签:

原文地址:http://www.cnblogs.com/Scorpio989/p/4418307.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!