leetcode Question 123: Wildcard Matching
来源:互联网 发布:熊片数据库手机版 编辑:程序博客网 时间:2024/06/05 00:35
Wildcard Matching
Implement wildcard pattern matching with support for
'?'
and '*'
.'?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).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") → falseisMatch("aa","aa") → trueisMatch("aaa","aa") → falseisMatch("aa", "*") → trueisMatch("aa", "a*") → trueisMatch("ab", "?*") → trueisMatch("aab", "c*a*b") → false
Analysis:
For each element in s
If *s==*p or *p == ? which means this is a match, then goes to next element s++ p++.
If p=='*', this is also a match, but one or many chars may be available, so let us save this *'s position and the matched s position.
If not match, then we check if there is a * previously showed up,
if there is no *, return false;
if there is an *, we set current p to the next element of *, and set current s to the next saved s position.
e.g.
abed
?b*d**
a=?, go on, b=b, go on,
e=*, save * position star=3, save s position ss = 3, p++
e!=d, check if there was a *, yes, ss++, s=ss; p=star+1
d=d, go on, meet the end.
check the rest element in p, if all are *, true, else false;
Note that in char array, the last is NOT NULL, to check the end, use "*p" or "*p=='\0'".
Code(C++):
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
class
Solution {
public
:
bool
isMatch(
const
char
*s,
const
char
*p) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
const
char
* star=NULL;
const
char
* ss=s;
while
(*s){
if
((*p==
'?'
)||(*p==*s)){s++;p++;
continue
;}
if
(*p==
'*'
){star=p++; ss=s;
continue
;}
if
(star){ p = star+1; s=++ss;
continue
;}
return
false
;
}
while
(*p==
'*'
){p++;}
return
!*p;
}
};
Code (Python):
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
class
Solution:
# @param s, an input string
# @param p, a pattern string
# @return a boolean
def
isMatch(
self
, s, p):
s_cur
=
0
;
p_cur
=
0
;
match
=
0
;
star
=
-
1
;
while
s_cur<
len
(s):
if
p_cur<
len
(p)
and
(s[s_cur]
=
=
p[p_cur]
or
p[p_cur]
=
=
'?'
):
s_cur
=
s_cur
+
1
p_cur
=
p_cur
+
1
elif
p_cur<
len
(p)
and
p[p_cur]
=
=
'*'
:
match
=
s_cur
star
=
p_cur
p_cur
=
p_cur
+
1
elif
(star!
=
-
1
):
p_cur
=
star
+
1
match
=
match
+
1
s_cur
=
match
else
:
return
False
while
p_cur<
len
(p)
and
p[p_cur]
=
=
'*'
:
p_cur
=
p_cur
+
1
if
p_cur
=
=
len
(p):
return
True
else
:
return
False
0 0
- leetcode Question 123: Wildcard Matching
- LeetCode: Wildcard Matching
- LeetCode : Wildcard Matching
- [LeetCode] Wildcard Matching - Iteratively
- leetcode 83: Wildcard Matching
- [Leetcode] Wildcard Matching
- [LeetCode]Wildcard Matching
- LeetCode-Wildcard Matching
- LeetCode -- Wildcard Matching
- LeetCode | Wildcard Matching
- Leetcode: Wildcard Matching
- Leetcode:Wildcard Matching
- LeetCode题解:Wildcard Matching
- LeetCode Wildcard Matching
- [Leetcode] Wildcard Matching (Java)
- LeetCode OJ:Wildcard Matching
- Leetcode: Wildcard Matching
- Wildcard Matching -- LeetCode
- Convert jQuery RGB output to Hex Color
- ECharts案例教程1
- Object V.S datastructure
- linux命令大全
- Leetcode OJ: Regular Expression Matching
- leetcode Question 123: Wildcard Matching
- 堆结构(二) - 左倾堆的原理与实现
- coding是工程师的基本修养
- 记录平时code点滴,这次是通过一张充满异样字符的表,对数据表中的每一列进行清理,比double quotation的issue难多了!
- 在编程竞赛中提高实战的技能
- http和https的区别
- 权限管理设计(一)
- 权限管理设计(二)
- nyoj 题目1080 年龄排序(下标排序)