文件名称:Word-Ladder
介绍说明－－下载内容均来自于网络，请自行研究使用
给定两个词(beginWord和endWord)和字典的单词列表,找到所有最短转换序列(s)beginWord endWord,这样: 一次只能改变一个字母；每个中间必须存在于词列表-Given two words (beginWord and endWord), and a dictionary s word list, find all shortest transformation sequence(s) beginWord to endWord, such that:
Only one letter can be changed at a time
Each intermediate word must exist in the word list
For example,
Given:
beginWord = hit
endWord = cog
wordList = [ hot , dot , dog , lot , log ]
Return
Only one letter can be changed at a time
Each intermediate word must exist in the word list
For example,
Given:
beginWord = hit
endWord = cog
wordList = [ hot , dot , dog , lot , log ]
Return
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Word Ladder.cpp