leetcode 10 Regular Expression Matching

原题链接：https://leetcode.com/problems/regular-expression-matching/

Description

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

Solution

c++11自带正则表达式,偷个懒直接用了

class Solution {public:    bool isMatch(string s, string p) {        regex reg(p);        return regex_match(s, reg);    }};