LeetCode 1023. Camelcase Matching

A query word matches a given pattern if we can insert lowercase letters to the pattern word so that it equals the query. (We may insert each character at any position, and may insert 0 characters.)

Given a list of queries, and a pattern, return an answer list of booleans, where answer[i] is true if and only if queries[i] matches the pattern.

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".

Note:

1 <= queries.length <= 100
1 <= queries[i].length <= 100
1 <= pattern.length <= 100
All strings consists only of lower and upper case English letters.

//a string processing question

    public List<Boolean> camelMatch(String[] queries, String pattern) {
        //queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FoBa"
        List<Boolean> list = new ArrayList<>();
        List<String> p = split(pattern);
        for (int i = 0; i < queries.length; i++) {
            List<String> q = split(queries[i]);
            if (p.size() != q.size()) {
                list.add(false);
                continue;
            } 
            boolean Match = true;
            for (int j = 0; j < p.size(); j++) {
                String s1 = p.get(j);
                String s2 = q.get(j);
                int p1 = 0;
                int p2 = 0;
                while (p1 < s1.length() && p2 < s2.length()) {
                    if (s1.charAt(p1) == s2.charAt(p2)) {
                        p1++;
                        p2++;
                    } else {
                        p2++;
                    }
                }
                if (p1 < s1.length()) {
                    Match = false;
                    break;
                }
            }
            list.add(Match);
        }
        return list;
    }
    public List<String> split(String s) {
        List<String> res = new ArrayList<>();
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (Character.isUpperCase(c)) {
                StringBuilder sb = new StringBuilder(c);
                i++;
                while (i < s.length() && Character.isLowerCase(s.charAt(i))) {
                    sb.append(s.charAt(i++));
                }
                res.add(sb.toString());
                i--;
            }
        }
        return res;
    }