C++实现经典字梯游戏：LeetCode题目解决方案

class Solution {
public:
map<string,vector<string> 
>computedAdjacentWords(const 
vector<string>& words)
{
    map<string,vector<string> > 
adjWords;
    map<int,vector<string> >    
wordsByLength;
    for(int i=0;i<words.size();i
++)
        wordsByLength[words[i]
.length()].push_back(words[i]);
    map<int,vector<string> 
>::const_iterator itr;
    for(itr=wordsByLength.begin
();itr!=wordsByLength.end
();++itr)
    {
        const vector<string>& 
groupsWords=itr->second;
        int groupNum=itr->first;
        for(int i=0;i<groupNum;i
++)
        {
            map<string,vector
<string> > repToWord;
            for(int j=0;j
<groupsWords.size();j++)

            {
                string rep
=groupsWords[j];
                rep.erase(i,1);
                if(!rep.empty
())repToWord[rep].push_back
(groupsWords[j]);
                else repToWord["
$"].push_back(groupsWords[j]);
            }
            map<string,vector
<string> >::const_iterator itr2;
            for(itr2=repToWord
.begin();itr2!=repToWord.end
();++itr2)
            {
                const vector
<string>& clique=itr2->second;
                if(clique.size
()>=2)
                    for(int p=0
;p<clique.size();p++)
                        for(int 
q=p+1;q<clique.size();q++)
                        {
                            
adjWords[clique[p]].push_back
(clique[q]);
                            
adjWords[clique[q]].push_back