LeetCode OJ——Word Ladder2

http://oj.leetcode.com/problems/word-ladder-ii/

class Solution {
public:
    vector<vector<string>> findLadders(string start, string end, unordered_set<string> &dict)
    {
        //map <string,string> parentRecord;
        multimap<string ,string> parentRecord;
        queue<pair<string ,int > > wordQueue;
        unordered_set<string> visited;
        wordQueue.push(make_pair(start,));
        visited.insert(start);

        parentRecord.insert(make_pair(start,""));

        int flag = ;
        int length = ;
        int flag2 = ;
        while(!wordQueue.empty())
        {
            string curStr = wordQueue.front().first;
            int curStep = wordQueue.front().second;

            if(flag == )
            {
                if(curStep != length)
                    break;
            }

            wordQueue.pop();

            for(int i = ;i<curStr.size();i++)
            {
                if(flag2 == )
                {
                    flag2 = ;
                    break;
                }
                string tmp = curStr;
                for(int j = ;j<;++j)
                {
                    flag2 = ;
                    tmp[i] = j+'a';
                    if(tmp == end)
                    {
                        //    return curStep+1;
                        parentRecord.insert(make_pair(tmp,curStr));
                        flag = ;
                        length = curStep;
                        flag2 = ;

                        wordQueue.push(make_pair(tmp,curStep+));
                        visited.insert(tmp);

                        break;
                    }
                    if(visited.find(tmp) == visited.end() && dict.find(tmp)!=dict.end())
                    {
                        wordQueue.push(make_pair(tmp,curStep+));
                        visited.insert(tmp);
                        parentRecord.insert(make_pair(tmp,curStr));
                    }
                }
            }
        }

        vector<vector<string> > ansVector;
        ansVector.clear();
        vector<string> onePiece;
        string str1 = end,str2;
        multimap<string,string>::iterator iter;
        int ii = parentRecord.count(end);
        vector<string> another;
        another.clear();

        for(int i = ;i<ii;i++)
        {
            str1 = end;
            onePiece.clear();
            another.clear();
            while()
            {
                onePiece.push_back(str1);

                iter = parentRecord.find(str1);

                if(  str1 == start)
                {
                    for(int it = onePiece.size()-;it>=;it--)
                        another.push_back(onePiece[it]);
                    ansVector.push_back(another);
                    break;
                }
                str2 = (*iter).second;
                if(parentRecord.count(str1)>)
                    parentRecord.erase(iter);
                str1 = str2;

            }
        }

        return ansVector;

    }
};

在visited那的处理那里弄错了，应该是更广一些。暂时不想改，先这样。

用到了multimap.因为map的话，key是唯一的，只能存储（cog,dog）不能一起存储(cog,dog),(cog,log).