Min Li's Note
KVM,QEMU, X86 virtualization
Pages
Home
Collection
About
Monday, December 8, 2014
Word Ladder
Problem
Given two words (start and end), and a dictionary, find the length of shortest transformation sequence 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,
Idea
Solution
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment