传送门 题目描述 给定一个起始单词，一个目标单词与一个备选字典，通过以下规则将起始单词变到目标单词去： 每次转换只能改变一个字母。 转换过程中的中间单词必须是字典中的单词。 求最短变化步数。 思路 看到最短步数，首先想到BFS。但使用BFS的前提是有一个可以用来搜索的图或者树，于是思维转向如何建立图/树。 思路还是很清……
来自分类：做题
你已到达了世界的尽头(｡・`ω´･)！
-
edisoncgh
最近访客
评论
-
于「4年前」在「互换友链」中说:
-
于「4年前」在「互换友链」中说:( ,,´･ω･)ﾉ"(´っω･｀｡)
-
于「4年前」在「poj2524：Ubiquitous Religions」中说:Hello there! This is my 1st comment here so I just wanted to give a quick shout out and say I really enjoy reading through your articles. Can you suggest any other blogs/websites/forums that cover the same subjects? Thank you!
-
于「4年前」在「C++Trie树(字典树)」中说:I wish to point out my passion for your generosity giving support to people who require help with your situation. Your special commitment to passing the solution around appears to be pretty significant and have usually made people like me to get to their aims. The important facts signifies a whole lot a person like me and a whole lot more to my fellow workers. Many thanks; from everyone of us. Frannie Prentiss Langille
-
于「4年前」在「C++Trie树(字典树)」中说:Awesome post. I am a regular visitor of your blog and appreciate you taking the time to maintain the excellent site. I will be a frequent visitor for a long time. Manon Cornie Elwina
-
