LeetCode OJ Word Ladder

Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, 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.

BFS, notice that searching in unordered_set is quicker than set.

class Solution {
public:
    struct step {
        string data;
        int s;
        step(string dd, int ss) {
            data = dd;
            s = ss;
        }
    };
    int ladderLength(string start, string end, unordered_set<string> &dict) {
        unordered_set<string> vis;
        queue<step> q;
        q.push(step(start, 0));
        vis.insert(start);
        while (!q.empty()) {
            step temp = q.front();
            q.pop();
            string made;
            for (int i = 0; i < temp.data.length(); i++) {
                made = temp.data;
                char posLetter = made[i];
                for (char j = 'a'; j <= 'z'; j++) {
                    if (posLetter != j) {
                        made[i] = j;
                        unordered_set<string>::iterator iter = dict.find(made);
                        if (vis.find(made) == vis.end() && iter != dict.end()) {
                            if (made == end) {
                                return temp.s + 2;
                            }
                            q.push(step(*iter, temp.s + 1));
                            vis.insert(made);
                        }
                    }
                }
            }
        }
        return 0;
    }
};