Word Ladder

最新推荐文章于 2024-09-08 21:02:59 发布

原创最新推荐文章于 2024-09-08 21:02:59 发布 · 272 阅读

0 ·

CC 4.0 BY-SA版权

刷遍数专栏收录该内容

260 篇文章

订阅专栏

本文介绍了一种解决单词梯问题的高效算法实现。通过使用队列进行层级遍历，并结合哈希集合快速查找，该算法能在给定单词列表中找到从开始单词到目标单词所需的最少转换步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

public class Solution {
    public int ladderLength(String beginWord, String endWord, Set<String> wordList) {
        Queue<WordNode> queue = new LinkedList<>();
        WordNode wn = new WordNode(beginWord, 1);
        queue.offer(wn);
        wordList.add(endWord);
        while (!queue.isEmpty()) {
            WordNode node = queue.poll();
            String word = node.word;
            if (word.equals(endWord)) {
                return node.steps;
            }
            for (int i = 0; i < word.length(); i++) {
                char[] chars = word.toCharArray();
                for (char c = 'a'; c <= 'z'; c++) {
                    if (chars[i] == c) {
                        continue;
                    }
                    chars[i] = c;
                    String newWord = new String(chars);
                    if (wordList.contains(newWord)) {
                        queue.offer(new WordNode(newWord, node.steps + 1));
                        ///////
                        wordList.remove(newWord);
                        ///////
                    }
                }
            }
        }
        return 0;
    }
    
    private class WordNode {
        String word;
        int steps;
        public WordNode (String word, int steps) {
            this.word = word;
            this.steps = steps;
        }
    }
}