Word Ladder

Question:

Given two words (start and end), and a dictionary, find the length of shortest transformation sequence 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"]

As one shortest transformation is "hit" -> "hot" -> "dot" -> "dog" -> "cog",
return its length 5.

Note:

  • Return 0 if there is no such transformation sequence.
  • All words have the same length.
  • All words contain only lowercase alphabetic characters.

//********** Hints ************

LZ认为leetcode里面有带word题干的题目都好难,此题也是其中之一,但是思路比较简单,用BFS即可:

一个Queue作为Breadth,一个Hashset作为判断visited

//*****************************

Solution:

public class Solution {
   public int ladderLength(String start, String end, HashSet dict) {
       Set<String> visited = new HashSet<String>();
       Queue<String> breadth = new LinkedList<String>();
       
       breadth.offer(start);
       visited.add(start);
       
       int step = 1;
       int count = 1;
       
       while(count > 0){
           while(count > 0){
               char[] cur = breadth.poll().toCharArray();
           
               for(int i = 0; i < cur.length; i++){
                   char temp = cur[i];
                   for(char c = 'a'; c <= 'z'; c++){
                        if(c == temp)
                            continue;
                        cur[i] = c;
                        String s = new String(cur);
                        if(s.equals(end))
                            return (step + 1);
                        if(!visited.contains(s) && dict.contains(s)){
                            breadth.offer(s);
                            visited.add(s);
                        }
                   }
                   cur[i] = temp;
               }
               count --;
           }
           
           step ++;
           count = breadth.size();
       }
       
       return 0;
    }
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值