Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:
- Only one letter can be changed at a time
- 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
class Solution { public: int ladderLength(string start, string end, unordered_set<string> &dict) { dict.insert(end); queue<pair<string,int>> q; q.push(make_pair(start,1)); while(!q.empty()) { auto cur=q.front(); string origi=cur.first; q.pop(); for(int i=0;i<cur.first.size();i++) { //for each char for(char j='a';j<='z';j++) { if(origi[i]!=j) { cur.first[i]=j; if(dict.count(cur.first)) { if(cur.first==end) { return cur.second+1; } else { pair<string,int> temp; temp.first=cur.first; temp.second=cur.second+1; q.push(temp); dict.erase(cur.first); } } } cur.first=origi; } } } return 0; } };