Given an array of strings queries
and a string pattern
, return a boolean array answer
where answer[i]
is true
if queries[i]
matches pattern
, and false
otherwise.
A query word queries[i]
matches pattern
if you can insert lowercase English letters pattern so that it equals the query. You may insert each character at any position and you may not insert any characters.
Example 1:
Input: queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FB"
Output: [true,false,true,true,false]
Explanation: "FooBar" can be generated like this "F" + "oo" + "B" + "ar".
"FootBall" can be generated like this "F" + "oot" + "B" + "all".
"FrameBuffer" can be generated like this "F" + "rame" + "B" + "uffer".
Example 2:
Input: queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FoBa"
Output: [true,false,true,false,false]
Explanation: "FooBar" can be generated like this "Fo" + "o" + "Ba" + "r".
"FootBall" can be generated like this "Fo" + "ot" + "Ba" + "ll".
Example 3:
Input: queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FoBaT"
Output: [false,true,false,false,false]
Explanation: "FooBarTest" can be generated like this "Fo" + "o" + "Ba" + "r" + "T" + "est".
Constraints:
-
1 <= pattern.length, queries.length <= 100
-
1 <= queries[i].length <= 100
-
queries[i]
andpattern
consist of English letters.
SOLUTION:
class Solution:
def camelMatch(self, queries: List[str], pattern: str) -> List[bool]:
n = len(pattern)
pattCaps = "".join([c for c in pattern if c.isupper()])
answer = []
for q in queries:
m = len(q)
qCaps = "".join([c for c in q if c.isupper()])
if pattCaps != qCaps:
answer.append(False)
continue
i = 0
j = 0
while i < n and j < m:
if pattern[i] == q[j]:
i += 1
j += 1
else:
j += 1
answer.append(i == n)
return answer
Top comments (0)