LeetCode题目：1023. 驼峰式匹配

题目

题目链接：https://leetcode-cn.com/problems/camelcase-matching/
题目解析：用正则表达式然后遍历得到答案

代码

import java.util.regex.Pattern;
class Solution {
    public List<Boolean> camelMatch(String[] queries, String pattern) {
        List<Boolean> list = new ArrayList<Boolean>();
		StringBuffer sb = new StringBuffer();
		for(int i=0;i<pattern.length();i++) {
			sb.append(pattern.charAt(i));
			sb.append("[a-z]*");
		}
		String regex = "[a-z]*"+sb.toString();
		for (int i = 0; i < queries.length; i++) {
			Pattern p = Pattern.compile(regex);
			String str = queries[i];
			list.add(p.matches(regex, str));
		}
    	return list;
        
    }
}