Class Solution
- java.lang.Object
-
- g1001_1100.s1023_camelcase_matching.Solution
-
public class Solution extends Object
1023 - Camelcase Matching.Medium
Given an array of strings
queries
and a stringpattern
, return a boolean arrayanswer
whereanswer[i]
istrue
ifqueries[i]
matchespattern
, andfalse
otherwise.A query word
queries[i]
matchespattern
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.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-