BFS应用：字典问题 Q127. Word Ladder

最新推荐文章于 2020-12-19 07:01:24 发布

WindowsSucks

最新推荐文章于 2020-12-19 07:01:24 发布

阅读量93

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/weixin_44015873/article/details/86481923

版权

算法专栏收录该内容

25 篇文章 0 订阅

订阅专栏

先贴一个超时的算法，因为这个解法一会就会被覆盖了:) 这个解法没有记录已经访问过的词组，所以问题规模一大马上就超时。

class Solution {
    public int ladderLength(String beginWord, String endWord, List<String> wordList){
        if(!wordList.contains(endWord))
            return 0;
        int ret = 1;
        LinkedList<String> queue = new LinkedList<>();
        queue.offer(beginWord);
        queue.offer(null);
        while(queue.size() != 1 && !queue.isEmpty()) {
            String temp = queue.poll();
            if(temp == null){
                ret++;
                queue.offer(null);
                continue;                
            }
            if(temp.equals(endWord)) {
                //System.out.println("succ ret = " + ret);
                return ret;
            }
            for(String word:wordList) {           
                if(diffOf(temp,word) == 1){
                    //System.out.println("offered " + word);
                    //System.out.println("ret =" + ret);
                    queue.offer(word); 
                }
            }
        }
        return 0;
    }
    private int diffOf(String s1, String s2) {
        if(s1.length() != s2.length())
            return Integer.MAX_VALUE;
        int dif = 0;
        for(int i=0;i < s1.length();i++) {
            if(s1.charAt(i) != s2.charAt(i))
                dif++;
        }
        return dif;    
    }
}

正确解法写完了再粘过来:)

这个是正确解法，tm的还是非常慢，运行了1500ms，可能因为visited不应该用linkedList，看看得了，别学我这算法。

class Solution {
    public int ladderLength(String beginWord, String endWord, List<String> wordList){
        if(!wordList.contains(endWord))
            return 0;
        int ret = 1;
        LinkedList<String> queue = new LinkedList<>();
        LinkedList<String> visited = new LinkedList();
        queue.offer(beginWord);
        queue.offer(null);
        while(queue.size() != 1 && !queue.isEmpty()) {
            String temp = queue.poll();
            if(temp == null){
                ret++;
                queue.offer(null);
                continue;                
            }
            if(temp.equals(endWord)) {
                //System.out.println("succ ret = " + ret);
                return ret;
            }
            for(String word:wordList) {           
                if(diffOf(temp,word) == 1){
                    //System.out.println("offered " + word);
                    //System.out.println("ret =" + ret);
                    if(!visited.contains(word)){
                    visited.offer(word);
                    queue.offer(word); 
                    }
                }
            }
        }
        return 0;
    }
    private int diffOf(String s1, String s2) {
        if(s1.length() != s2.length())
            return Integer.MAX_VALUE;
        int dif = 0;
        for(int i=0;i < s1.length();i++) {
            if(s1.charAt(i) != s2.charAt(i))
                dif++;
        }
        return dif;    
    }
}

改成HashSet了，快了一倍，但是还是挺慢的。。。

class Solution {
    public int ladderLength(String beginWord, String endWord, List<String> wordList){
        if(!wordList.contains(endWord))
            return 0;
        int ret = 1;
        LinkedList<String> queue = new LinkedList<>();
        Set<String> visited = new HashSet<String>();
        queue.offer(beginWord);
        queue.offer(null);
        while(queue.size() != 1 && !queue.isEmpty()) {
            String temp = queue.poll();
            if(temp == null){
                ret++;
                queue.offer(null);
                continue;                
            }
            if(temp.equals(endWord)) {
                //System.out.println("succ ret = " + ret);
                return ret;
            }
            for(String word:wordList) {           
                if(diffOf(temp,word) == 1){
                    //System.out.println("offered " + word);
                    //System.out.println("ret =" + ret);
                    if(!visited.contains(word)){
                    visited.add(word);
                    queue.offer(word); 
                    }
                }
            }
        }
        return 0;
    }
    private int diffOf(String s1, String s2) {
        if(s1.length() != s2.length())
            return Integer.MAX_VALUE;
        int dif = 0;
        for(int i=0;i < s1.length();i++) {
            if(s1.charAt(i) != s2.charAt(i))
                dif++;
        }
        return dif;    
    }
}