题目:
思路:
一开始我是想用直观的方法,,先求出diff数组(各个word之间不同char的数量,如下图所示),然后,从beginWord开始,顺着diff值为1的路径一直到endWord。但是超时了。测试了几个小用例,思路应该是正确的,但可能存在很多重复计算导致运算量剧增导致超时。
另一种方法,直接通过递归对wordList进行深度优先搜索,然后又超时了。
然后又尝试模仿Dijkstra算法,使用动态规划。然后submit结果是33/43 test cases passed
,虽然超时了,但应该是正确的。
暂时没思路了,未完待续…
代码实现:
第一种方法(超时)代码如下:
class Solution {
public:
int getdiff(string s1, string s2){
int diff = 0;
for (int i = 0; i < s1.size(); ++i){
if (s1[i] != s2[i]){
++diff;
}
}
return diff;
}
void f(vector<string>& wordList, vector<bool> &isSelected, int i,bool isRowIndex, int cur_len, int &min, const string &endWord, vector<vector<int>>& diff){
if (wordList[i] == endWord){
if (cur_len < min){
min = cur_len;
}
return ;
}
for (int ii = 0; ii < wordList.size(); ++ii){
if (isSelected[ii] == true){
continue;
}
if (isRowIndex){
if (diff[i][ii] == 1){
isSelected[ii] = true;
f(wordList, isSelected, ii, 1-isRowIndex, cur_len+1, min, endWord, diff);
isSelected[ii] = false;
}
}else{
if (diff[ii][i] == 1){
isSelected[ii] = true;
f(wordList, isSelected, ii, 1-isRowIndex, cur_len+1, min, endWord, diff);
isSelected[ii] = false;
}
}
}
}
int ladderLength(string beginWord, string endWord, vector<string>& wordList) {
// 判断endWord是否存在
bool hasEndWord = false;
for (int i = 0; i < wordList.size(); ++i){
if (wordList[i] == endWord){
hasEndWord = true;
break;
}
}
if (hasEndWord == false){
return 0;
}
wordList.insert(wordList.begin(),beginWord);
int word_num = wordList.size();
vector<vector<int>> diff(word_num, vector<int>(word_num, 0));
vector<bool> isSelected(word_num, false);
int ans = INT_MAX;
for (int i = 0; i < word_num; ++i){
for (int j = i+1; j < word_num; ++j){
diff[i][j] = diff[j][i] = getdiff(wordList[i], wordList[j]);
}
}
isSelected[0] = true;
f(wordList, isSelected, 0, true, 1, ans, endWord, diff);
if (ans == INT_MAX){
return 0;
}
return ans;
}
};
第二种方法(超时)的代码如下:
class Solution {
public:
int getdiff(string s1, string s2){
int diff = 0;
for (int i = 0; i < s1.size(); ++i){
if (s1[i] != s2[i]){
++diff;
}
}
return diff;
}
void f(vector<string>& wordList, string &preStr, string &endWord, int len, int &min, vector<bool> isSelected){
for (int i = 0; i < wordList.size(); ++i){
if (isSelected[i] == true || getdiff(preStr, wordList[i]) != 1){
continue;
}
if (wordList[i] == endWord){
if (len + 1 < min){
min = len+1;
}
return ;
}
isSelected[i] = true;
f(wordList, wordList[i], endWord, len+1, min, isSelected);
isSelected[i] = false;
}
return ;
}
int ladderLength(string beginWord, string endWord, vector<string>& wordList) {
// 判断endWord是否存在
bool hasEndWord = false;
for (int i = 0; i < wordList.size(); ++i){
if (wordList[i] == endWord){
hasEndWord = true;
break;
}
}
if (hasEndWord == false){
return 0;
}
int ans = INT_MAX;
vector<bool> isSelected(wordList.size(), false);
f(wordList, beginWord, endWord, 1, ans, isSelected);
if (ans == INT_MAX){
return 0;
}
return ans;
}
};
第三种方法(动态规划,超时)的代码如下:
class Solution {
public:
int getdiff(string s1, string s2){
int diff = 0;
for (int i = 0; i < s1.size(); ++i){
if (s1[i] != s2[i]){
++diff;
}
}
return diff;
}
void f(vector<string>& wordList, string &preStr, string &endWord, int len, int &min, vector<bool> isSelected){
for (int i = 0; i < wordList.size(); ++i){
if (isSelected[i] == true || getdiff(preStr, wordList[i]) != 1){
continue;
}
if (wordList[i] == endWord){
if (len + 1 < min){
min = len+1;
}
return ;
}
isSelected[i] = true;
f(wordList, wordList[i], endWord, len+1, min, isSelected);
isSelected[i] = false;
}
return ;
}
int ladderLength(string beginWord, string endWord, vector<string>& wordList) {
// 判断endWord是否存在
bool hasEndWord = false;
int end_i;
for (int i = 0; i < wordList.size(); ++i){
if (wordList[i] == endWord){
hasEndWord = true;
end_i = i;
break;
}
}
if (hasEndWord == false){
return 0;
}
/
wordList.insert(wordList.begin(), beginWord);
++end_i;
int word_nums = wordList.size();
vector<bool> isSelected(word_nums, false);
vector<int> dp(word_nums, INT_MAX);
isSelected[0] = true;
dp[0] = 1;
int i = 0;
while (true){
int min = INT_MAX;
int min_i = -1;
for (int j = 0; j < word_nums; ++j){
if (i == j || isSelected[j] == true){
continue ;
}
if (getdiff(wordList[i], wordList[j]) != 1){
if (dp[j] < min){
min = dp[j];
min_i = j;
}
continue;
}
// 更新dp
if (dp[i] + 1 < dp[j]){
dp[j] = dp[i] + 1;
}
if (dp[j] < min){
min = dp[j];
min_i = j;
}
}
if (min == INT_MAX || min_i == -1){
break;
}
// 选出最小i
isSelected[min_i] = true;
i = min_i;
}
if (dp[end_i] == INT_MAX){
return 0;
}
return dp[end_i];
}
};
discuss:
// DFS深度优先遍历(不知为何,就是超时)
class Solution {
public:
int ladderLength(string beginWord, string endWord, vector<string>& wordList) {
unordered_set<string> dict(wordList.begin(), wordList.end());
queue<string> todo;
todo.push(beginWord);
int ladder = 1; // 我们要的答案
while (!todo.empty()){ // 一层一层地遍历
int n = todo.size(); // 记录当前一层的word个数,因为后面会逐个再添加新word
for (int i = 0; i < n; ++i){ // 遍历一层
string word = todo.front();
todo.pop();
if (word == endWord){
return ladder;
}
dict.erase(word);
for (int j = 0; j < word.size(); ++j){ // 对word中每个char都变换成26个字母试下
char c = word[j]; // 保护现场
for (int k = 0; k < 26; ++k){ // 每个char的26种情况
word[j] = 'a' + k;
if (dict.find(word) != dict.end()){ // 如果dict存在ta
todo.push(word);
}
}
word[j] = c; // 恢复现场
}
}
++ladder;
}
return 0;
}
};