1023. Camelcase Matching**

1023. Camelcase Matching**

https://leetcode.com/problems/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.

C++ 实现 1

仔细观察三个例子. 现在问题是如何判断一个 query 符合 pattern.

下面实现中, isMatch 是核心, 其中:

(query[i] >= 97 && query[i] <= 122) // 判断小写字母
(query[i] >= 65 && query[i] <= 90) // 判断大写字母

当然还可以使用 std::islower 和 std::isupper.

class Solution {
private:
    bool isMatch(const string &pattern, const string &query) {
        int k = 0, i = 0;
        while (i < query.size() && k < pattern.size()) {
            if (query[i] == pattern[k]) {
                ++ i;
                ++ k;
            } else {
                if (query[i] >= 97 && query[i] <= 122) ++ i;
                else if (query[i] >= 65 && query[i] <= 90) return false; 
            }
        }
        // 如果 k 已到达边界但是 i 没有到达边界 (边界就是单词的大小), 
        // 那么如果 i 后面的字母都是小写字母, 要过滤
        while (i < query.size() && query[i] >= 97 && query[i] <= 122) ++ i;
        if (i == query.size() && k == pattern.size()) return true;
        else return false;
    }
public:
    vector<bool> camelMatch(vector<string>& queries, string pattern) {
        vector<bool> res;
        for (auto &query : queries) {
            res.push_back(isMatch(pattern, query));
        }
        return res;
    }
};