LeetCode 1023. 驼峰式匹配（暴力匹配）

示例 1：
输入：queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FB"
输出：[true,false,true,true,false]
示例：
"FooBar" 可以这样生成："F" + "oo" + "B" + "ar"。
"FootBall" 可以这样生成："F" + "oot" + "B" + "all".
"FrameBuffer" 可以这样生成："F" + "rame" + "B" + "uffer".

示例 2：
输入：queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FoBa"
输出：[true,false,true,false,false]
解释：
"FooBar" 可以这样生成："Fo" + "o" + "Ba" + "r".
"FootBall" 可以这样生成："Fo" + "ot" + "Ba" + "ll".

示例 3：
输出：queries = ["FooBar","FooBarTest","FootBall","FrameBuffer","ForceFeedBack"], pattern = "FoBaT"
输入：[false,true,false,false,false]
解释： 
"FooBarTest" 可以这样生成："Fo" + "o" + "Ba" + "r" + "T" + "est".
 
提示：
1 <= queries.length <= 100
1 <= queries[i].length <= 100
1 <= pattern.length <= 100
所有字符串都仅由大写和小写英文字母组成。

class Solution {
	int i, j, ni, nj;
public:
    vector<bool> camelMatch(vector<string>& queries, string pattern) {
        nj = pattern.size();
        vector<bool> ans;
        for(auto& str : queries)
        	ans.push_back(match(str,pattern));
        return ans;
    }

    bool match(string& str, string& pattern)
    {
    	i=j=0;
    	ni = str.size();
    	while(i < ni && j < nj)
    	{
    		if(str[i]==pattern[j])
    		{
    			i++,j++;//相同都移动
    		}
    		else//不相同
    		{
    			if(isupper(str[i]))//字符是大写，匹配不了
    				return false;
    			else
    				i++;//是小写，往后移动
    		}
    	}
    	if(i < ni)//pattern 匹配完了
    	{
    		while(i < ni)
    			if(isupper(str[i++]))//主串还有大写，错
    				return false;
    	}
    	if(j < nj)//模式串没匹配完，错
    		return false;
    	return true;
    }
};