Word ladder: Difference between revisions
m
C++ code made simpler and a bit faster
(→{{header|Haskell}}: added the simple and efficient solution) |
m (C++ code made simpler and a bit faster) |
||
Line 59:
}
return result;
}
Line 79 ⟶ 73:
auto curr = queue.front();
queue.erase(queue.begin());
}
if (
curr.push_back(to);
std::cout << join(curr.begin(), curr.end(), " -> ") << '\n';
return true;
}
}),▼
▲ poss.end());
std::vector<std::string> temp(curr);
temp.push_back(
queue.push_back(std::move(temp));
}
}
|