leetcode

0 class Solution {

1 public:

2 vector<bool> camelMatch(const vector<string> &queries, const string &pattern) {

3 vector<bool> res(queries.size(), false);

4 for (int k = 0; k < queries.size(); k++) {

5 const string &query = queries[k];

6 int i = 0, j = 0;

7 while (i < query.size()) {

8 if (!isupper(query[i])) {

9 if (query[i] == pattern[j]) j++;

10 i++;

11 } else {

12 if (j == pattern.size() || query[i] != pattern[j]) goto next;

13 i++, j++;

14 }

15 }

16 if (j == pattern.size()) res[k] = true;

17 next:;

18 }

19 return res;

20 }

21 };