126. Word Ladder II

//very interesting problem //It can be solved with standard BFS. The tricky idea is doing BFS of paths instead of words! //Then the queue becomes a queue of paths. class Solution { public: vector<vect

>>阅读原文<<