标签：Count Obtained Google letters string int targetWords abcd startWords

You are given two 0-indexed arrays of strings startWords and targetWords. Each string consists of lowercase English letters only.

For each string in targetWords, check if it is possible to choose a string from startWords and perform a conversion operation on it to be equal to that from targetWords.

The conversion operation is described in the following two steps:

• Append any lowercase letter that is not present in the string to its end.
  For example, if the string is "abc", the letters 'd', 'e', or 'y' can be added to it, but not 'a'. If 'd' is added, the resulting string will be "abcd".
• Rearrange the letters of the new string in any arbitrary order.
  For example, "abcd" can be rearranged to "acbd", "bacd", "cbda", and so on. Note that it can also be rearranged to "abcd" itself.

Return the number of strings in targetWords that can be obtained by performing the operations on any string of startWords.

Solution

由于可以进行 \(rearrange\)，所以我们只需要用 \(sort\) 即可。然后用 \(map\) 来查找即可

class Solution {
private:
    unordered_set<string> s;
    int ans=0;
    
public:
    int wordCount(vector<string>& sw, vector<string>& tw) {
        int n = sw.size(), m = tw.size();
        for(int i=0;i<n;i++){
            sort(sw[i].begin(), sw[i].end());
            s.insert(sw[i]);
        }
        for(int i=0;i<m;i++){
            string cur = tw[i];
            sort(cur.begin(), cur.end());
            for(int j=0;j<tw[i].size();j++){
                string tmp=cur;
                tmp.erase(tmp.begin()+j);
                if(s.find(tmp)!=s.end()){ans++;break;}
            }
        }
        return ans;
    }
};

标签：Count,Obtained,Google,letters,string,int,targetWords,abcd,startWords
来源： https://www.cnblogs.com/xinyu04/p/16654126.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。