问题描述
如果我们可以将小写字母插入模式串 pattern 得到待查询项 query,那么待查询项与给定模式串匹配。(我们可以在任何位置插入每个字符,也可以插入 0 个字符。)
给定待查询列表 queries,和模式串 pattern,返回由布尔值组成的答案列表 answer。只有在待查项 queries[i] 与模式串 pattern 匹配时, answer[i] 才为 true,否则为 false。
示例 1:
输入:queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FB"
输出:[true,false,true,true,false]
示例:
"FooBar" 可以这样生成:"F" + "oo" + "B" + "ar"。
"FootBall" 可以这样生成:"F" + "oot" + "B" + "all".
"FrameBuffer" 可以这样生成:"F" + "rame" + "B" + "uffer".
示例 2:输入:queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FoBa"
输出:[true,false,true,false,false]
解释:
"FooBar" 可以这样生成:"Fo" + "o" + "Ba" + "r".
"FootBall" 可以这样生成:"Fo" + "ot" + "Ba" + "ll".
示例 3:输出:queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FoBaT"
输入:[false,true,false,false,false]
解释:
"FooBarTest" 可以这样生成:"Fo" + "o" + "Ba" + "r" + "T" + "est".
提示:
1 <= queries.length <= 100
1 <= queries[i].length <= 100
1 <= pattern.length <= 100
所有字符串都仅由大写和小写英文字母组成。来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/camelcase-matching
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
Java
class Solution {
public List<Boolean> camelMatch(String[] queries, String pattern) {
List<Boolean> ans = new ArrayList<>(queries.length);
for(String query : queries){
ans.add(isMatch(query,pattern));
}
return ans;
}
public boolean isMatch(String query,String pattern){
int queryIndex = 0;
int patternIndex = 0;
int queryLen = query.length();
int patternLen = pattern.length();
char[] queryArr = query.toCharArray();
char[] patternArr = pattern.toCharArray();
while(queryIndex < queryLen && patternIndex < patternLen){
if(queryArr[queryIndex] == patternArr[patternIndex]){
queryIndex++;
patternIndex++;
}else {
if(queryArr[queryIndex] >= 'A' && queryArr[queryIndex] <= 'Z') return false;
queryIndex++;
}
}
if(patternIndex != patternLen) return false;
while(queryIndex < queryLen){
char c = queryArr[queryIndex++];
if(c >= 'A' && c <= 'Z') return false;
}
return true;
}
}