@@ -0,0 +1,1384 @@
+%22%22%22Leetcode 127. Word Ladder%0AMedium%0A%0AURL: https://leetcode.com/problems/word-ladder/%0A%0AGiven two words (beginWord and endWord), and a dictionary's word list,%0Afind the length of shortest transformation sequence from beginWord to endWord,%0Asuch that:%0A%0AOnly one letter can be changed at a time.%0AEach transformed word must exist in the word list.%0ANote that beginWord is not a transformed word.%0A%0ANote:%0A- Return 0 if there is no such transformation sequence.%0A- All words have the same length.%0A- All words contain only lowercase alphabetic characters.%0A- You may assume no duplicates in the word list.%0A- You may assume beginWord and endWord are non-empty and are not the same.%0A%0AExample 1:%0AInput:%0AbeginWord = %22hit%22,%0AendWord = %22cog%22,%0AwordList = %5B%22hot%22,%22dot%22,%22dog%22,%22lot%22,%22log%22,%22cog%22%5D%0AOutput: 5%0AExplanation: As one shortest transformation is%0A%22hit%22 -%3E %22hot%22 -%3E %22dot%22 -%3E %22dog%22 -%3E %22cog%22,%0Areturn its length 5.%0A%0AExample 2:%0AInput:%0AbeginWord = %22hit%22%0AendWord = %22cog%22%0AwordList = %5B%22hot%22,%22dot%22,%22dog%22,%22lot%22,%22log%22%5D%0AOutput: 0%0AExplanation: The endWord %22cog%22 is not in wordList,%0Atherefore no possible transformation.%0A%22%22%22%0A%0Aclass Solution(object):%0A    def ladderLength(self, beginWord, endWord, wordList):%0A        %22%22%22%0A        :type beginWord: str%0A        :type endWord: str%0A        :type wordList: List%5Bstr%5D%0A        :rtype: int%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc0127_word_ladder.py