Java for LeetCode 126 Word Ladder II

标签：

Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that:

    Only one letter can be changed at a time
    Each intermediate word must exist in the dictionary

For example,

Given:
start = "hit"
end = "cog"
dict = ["hot","dot","dog","lot","log"]

Return

  [
    ["hit","hot","dot","dog","cog"],
    ["hit","hot","lot","log","cog"]
  ]
解题思路：

Java for LeetCode 126 Word Ladder II

标签：

原文地址：http://www.cnblogs.com/tonyluis/p/4532803.html