-
Notifications
You must be signed in to change notification settings - Fork 0
/
44.WildcardMatching.cpp
56 lines (49 loc) · 1.53 KB
/
44.WildcardMatching.cpp
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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
// Source : https://leetcode-cn.com/problems/wildcard-matching/
// Author : Lianfeng Shen
// Date : 2019-05-16
// dp
class Solution {
public:
bool isMatch(string s, string p) {
bool dp[s.size()+1][p.size()+1];
fill(dp[0], dp[0] + (s.size()+1) * (p.size()+1), false);
for (int i=0; i <= s.size(); i++) {
for (int j=0; j <= p.size(); j++) {
if (i == 0 && j == 0) {
dp[i][j] = true;
} else if (i == 0) {
dp[i][j] = dp[i][j-1] && p[j-1] == '*';
} else if (j == 0) {
dp[i][j] = false;
} else {
dp[i][j] = (dp[i-1][j-1] && (s[i-1] == p[j-1] || p[j-1] == '?')) || ((dp[i][j-1] || dp[i-1][j]) && p[j-1] == '*');
}
}
}
return dp[s.size()][p.size()];
}
};
// backtracking
class Solution {
public:
bool isMatch(string s, string p) {
int i = 0, j = 0;
int start = -1;
int match;
while (i < s.size()) {
if (j < p.size() && (s[i] == p[j] || p[j] == '?')) {
i++; j++;
} else if (j < p.size() && p[j] == '*') {
start = j++;
match = i;
} else if (start != -1) {
i = ++match;
j = start+1;
} else {
return false;
}
}
while (j < p.size() && p[j] == '*') j++;
return j == p.size();
}
};