Camelcase Matching LeetCode solution in Java

1
class Solution {
2
  public List<Boolean> camelMatch(String[] queries, String pattern) {
3
    List<Boolean> list = new ArrayList<>();
4

5
    for (var q : queries) {
6
      int index = 0;
7
      boolean flag = true;
8
      for (var c : q.toCharArray()) {
9
        if (index < pattern.length() && c == pattern.charAt(index)) {
10
          index++;
11
          continue;
12
        }
13
        if (c >= 'A' && c <= 'Z') {
14
          if (index >= pattern.length() || c != pattern.charAt(index)) {
15
            flag = false;
16
            break;
17
          }
18
        }
19
      }
20
      flag = flag && index == pattern.length();
21
      list.add(flag);
22
    }
23
    return list;
24
  }
25
}