[leetcode]Word Ladder

Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start toend, such that:

1. Only one letter can be changed at a time
2. Each intermediate word must exist in the dictionary

For example,

Given:
start = "hit"
end = "cog"
dict = ["hot","dot","dog","lot","log"]

As one shortest transformation is "hit" -> "hot" -> "dot" -> "dog" -> "cog",
return its length 5.

Note:

• Return 0 if there is no such transformation sequence.
• All words have the same length.
• All words contain only lowercase alphabetic characters.

崩溃了，大集合一直过不了 T T 我在思考第三个note是什么意思。。。

class Solution {
public:
    int distance(string s1, string s2){
        //return 10;
        int dist = 0;
        
        for(int i = 0; i < s1.size(); i++){
            if(s1[i] != s2[i]){
                dist++;
            }
         //   if(dist > 1) return 2;    
        }
        
        return dist;
    }

   void pushNext(string word, queue<string> &q, unordered_set<string> &dict){
        string cur;
        
        unordered_set<string>::iterator it = dict.begin();
        while(it != dict.end()){
            cur = *it;
            if(distance(cur, word) == 1){
                q.push(cur);
                it = dict.erase(it);
            }else{
                it++;
            }
        }

    }
    
    

    int ladderLength(string start, string end, unordered_set<string> &dict) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int result = 2;
        
        queue<string> q1;
        queue<string> q2;
        
        q1.push(start);
        
        string cur, next;
        vector<string> nexts;
        
        while(!dict.empty() &&(!q1.empty() || !q2.empty())){
            while(!q1.empty()){
                cur = q1.front();
                q1.pop();
                if(distance(cur, end) == 1){
                    return result;
                }else{
                    pushNext(cur, q2, dict);
                }
            }
            result++;
            
            while(!q2.empty()){
                cur = q2.front();
                q2.pop();
                if(distance(cur, end) == 1){
                    return result;
                }else{
                    pushNext(cur, q1, dict);
                }
            }
            
            result++;
            
        }
        
        return 0;
        
        
    }
};