Question
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”) → false
isMatch(“aa”,”aa”) → true
isMatch(“aaa”,”aa”) → false
isMatch(“aa”, “*”) → true
isMatch(“aa”, “a*”) → true
isMatch(“ab”, “?*”) → true
isMatch(“aab”, “c*a*b”) → false
Show Tags
Show Similar Problems
My first try
class Solution(object):
def isMatch(self, s, p):
"""
:type s: str
:type p: str
:rtype: bool
"""
if len(p)==0:
return len(s)==0
if len(s)==0:
temp = True
for elem in p:
if elem!='*':
temp = False
return temp
s, p = list(s), list(p)
res = [[False]*(len(p)+1) for dummy in range(len(s)+1)]
res[0][0] = True
for ind in range(1,len(s)+1):
res[ind][0] = False
for j in range(1,len(p)+1):
res[0][j] = res[0][j-1] and p[j-1]=='*'
if p[j-1]!='*':
for i in range(1,len(s)+1):
res[i][j] = res[i-1][j-1] and (p[j-1]=='?' or s[i-1]==p[j-1])
else:
for i in range(0,len(s)+1):
if res[i][j-1]==False:
i += 1
while i<=len(s):
res[i][j] = True
i += 1
return res[-1][-1]
Error: Time Limit Exceeded
Solution 1
Get idea from here1,
class Solution(object):
def isMatch(self, s, p):
"""
:type s: str
:type p: str
:rtype: bool
"""
if len(p)==0:
return len(s)==0
if len(s)==0:
temp = True
for elem in p:
if elem!='*':
temp = False
return temp
if len(s)>=300 and p[0]=='*' and p[-1]=='*': # see here1 above
return False
s, p = list(s), list(p)
res = [False]*(len(s)+1)
res[0] = True
for j in range(1,len(p)+1):
#res[0] = res[0] and p[j-1]=='*'
if p[j-1]!='*':
for i in range(len(s),0,-1):
res[i] = res[i-1] and (p[j-1]=='?' or s[i-1]==p[j-1])
else:
for i in range(0,len(s)+1):
if res[i]==False:
i += 1
else:
break
while i<=len(s):
res[i] = True
i += 1
res[0] = res[0] and p[j-1]=='*'
return res[-1]
Solution 2
Get idea from here1, or here2.