-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRegularExpressionMatch.cpp
More file actions
41 lines (34 loc) · 1.02 KB
/
RegularExpressionMatch.cpp
File metadata and controls
41 lines (34 loc) · 1.02 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
/**
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 (0 == *p) return 0 == *s;
if (*(p+1) != '*') {
if (*p == *s || (*p) == '.' && (*s) != NULL)
return isMatch(s+1, p+1);
return false;
}else {
while (*p == *s || ((*p) == '.' && (*s) != NULL)){
if (isMatch(s,p+2))
return true;
s ++;
}
return isMatch(s, p+2);
}
}
};