LeetCode word latter

题目描述

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 length5.

Note:

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

ac代码

class Solution {
public:
    int ladderLength(string start, string end, unordered_set<string> &dict) {
int length = 0;
queue<string> queue;
string prev = start;
int high = 1;
//int level = 1;
queue.push(start);
while (!queue.empty())
{//high记录高度
int size = queue.size();
while (size--)
{
string prev = queue.front();
queue.pop();
char ch;
for (int i = 0; i < prev.length(); i++)
{
ch = prev[i];
for (int j = 0; j < 26; j++)
{
prev[i] = 'a' + j;
if (prev == end)
return high+1;
if (dict.find(prev) != dict.end())
{
queue.push(prev);
dict.erase(prev);
}
                       
}
prev[i] = ch;
}

}
            high++;
}
return 0;
}
};