blob: 67687d45827bcbd0761780b82778dceafecc5737 (
plain)
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
57
58
59
60
61
62
63
64
|
/*
Challenge 099
TASK #1 � Pattern Match
Submitted by: Mohammad S Anwar
You are given a string $S and a pattern $P.
Write a script to check if given pattern validate the entire string.
Print 1 if pass otherwise 0.
The patterns can also have the following characters:
? - Match any single character.
* - Match any sequence of characters.
Example 1:
Input: $S = "abcde" $P = "a*e"
Output: 1
Example 2:
Input: $S = "abcde" $P = "a*d"
Output: 0
Example 3:
Input: $S = "abcde" $P = "?b*d"
Output: 0
Example 4:
Input: $S = "abcde" $P = "a*c?e"
Output: 1
*/
#include <iostream>
bool match(const char* s, const char* p) {
while (true) {
if (!*s && !*p) // string and pattern finished
return true;
else if (!*s || !*p) // either string or pattern finished
return false;
else if (*p == '?') { // match any character
s++; p++;
}
else if (*p == '*') { // match any sub-sequence
p++;
for (int i = 0; s[i]; i++) {
if (match(s + i, p))
return true;
}
return false;
}
else if (*p != *s) { // chars different
return false;
}
else { // search next char
s++; p++;
}
}
}
int main(int argc, char* argv[]) {
if (argc == 3)
std::cout << (match(argv[1], argv[2]) ? 1 : 0) << std::endl;
else {
std::cerr << "Usage: ch-1 string pattern" << std::endl;
return EXIT_FAILURE;
}
}
|
