127. Word Ladder LeetCode

题意：给出一个开头单词，一个结尾单词，还有一个字典，单词之间之差一个字母的可以相互转换，问开头单词与字典里面的单词交换多少次能转换成结尾单词。
题解：很显然建边，然后BFS。但是很容易TLE或者MLE，所以要注意建边的姿势。

class Solution {
public:
    int ladderLength(string beginWord, string endWord, unordered_set<string>& wordList) {
        vector<string> str;
        str.push_back(beginWord);
        str.push_back(endWord);
        for(auto it = wordList.begin(); it != wordList.end(); it++)
        {
            if(*it == beginWord || *it == endWord) continue;
            str.push_back(*it);
        }
        int n = str.size();
        vector<vector<int>> edge;
        unordered_map<string,int> hash;
        hash.clear();
        for(int i = 0; i < n; i++) edge.push_back(vector<int>{}),hash[str[i]] = i;
        for(int i = 0; i < n - 1; i++)
        {
            int len = str[i].length();
            for(int j = 0; j < len; j++)
            {
                string s = str[i];
                for(int k = 0; k < 26; k++)
                {
                    s[j] = k + 'a';
                    if(hash.find(s) != hash.end())
                    {
                         int v = hash[s];
                         edge[i].push_back(v);
                         edge[v].push_back(i);
                    }
                }
            }
        }
        int d[n];
        bool vis[n];
        memset(d,0,sizeof(d));
        memset(vis,false,sizeof(vis));
        queue<int> q;
        while(!q.empty()) q.pop();
        q.push(0);
        d[0] = 1;
        vis[0] = true;
        while(!q.empty())
        {
            int now = q.front();
            q.pop();
            for(int i = 0; i < edge[now].size(); i++)
            {
                int nxt = edge[now][i];
                if(!vis[nxt])
                {
                    d[nxt] = d[now] + 1;
                    q.push(nxt);
                    vis[nxt] = true;
                    if(nxt == 1)
                        return d[nxt];
                }
            }
        }
        return d[1];
    }
};