LeetCode--word-ladder-ii（too hard）

题目太难，有时间再看！

题目描述

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

1. Only one letter can be changed at a time
2. 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"]
  ]

Note:

• All words have the same length.
• All words contain only lowercase alphabetic characters.

解题思路：

参考：http://www.cnblogs.com/ShaneZhang/p/3748494.html

文章中的代码并没有通过全部测试！