word ladder

最新推荐文章于 2019-06-04 09:48:26 发布

莫妮卡啊

最新推荐文章于 2019-06-04 09:48:26 发布

阅读量126

点赞数

分类专栏：撸代码笔记

本文链接：https://blog.csdn.net/u013401204/article/details/80679412

版权

撸代码笔记专栏收录该内容

30 篇文章 0 订阅

订阅专栏

题目描述：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,
    Given:
    start ="hit"
    end ="cog"
    dict =["hot","dot","dog","lot","log"]
As one shortest transformation is"hit" -> "hot" -> "dot" -> "dog" -> "cog",
return its length5.
Note:
Return 0 if there is no such transformation sequence.
All words have the same length.

All words contain only lowercase alphabetic characters.

import java.util.LinkedList;
import java.util.HashSet;
import java.util.Iterator;
public class Solution {
    public int ladderLength(String start, String end, HashSet<String> dict) {
        //层序遍历思想
        int res=0;
        LinkedList<String> q=new LinkedList<String>();
        q.offer(start);
        while(!q.isEmpty()){
                int size=q.size();
                while(size>0){
                     
                    String s=q.poll();
                    size--;
                    //当前弹出的字符串恰好就等于end了
                    if(s.equals(end))
                        return res+1;
                    //遍历dict找到和当前字符串相差一个字符的字符串
                    for(Iterator<String> it=dict.iterator();it.hasNext();){
                        //每次取dict中的一个字符串
                        String str=it.next();
                        if(oneCharDiff(s,str)){
                            //如果str和s只差一个字符
                            q.offer(str);
                            it.remove();//要把当前字符串从dict中删除 这里没太想明白
                        }
                    }
                     
                    
                }
            //遍历完了一层
            res++;
        }
        return 0;
    }
     
    public boolean oneCharDiff(String s1, String s2){
        int count=0;
        if(s1.length()!=s2.length())
            return false;
        for(int i=0;i<s1.length();i++){
            if(s1.charAt(i)!=s2.charAt(i))
                count++;
        }
        return count==1 ? true: false;
    }
}

广度优先搜索？？？

这里还有注意java中队里的使用声明基本操作