LeetCode C++ 127. Word Ladder【BFS/String】中等
Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such that:
Only one letter can be changed at a time.
Each transformed word must exist in the word list.
原创
2020-11-08 17:25:37 ·
211 阅读 ·
0 评论