Leetcode(java) 127. Word Ladder

Q:

A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that:

    Every adjacent pair of words differs by a single letter.
    Every si for 1 <= i <= k is in wordList. Note that beginWord does not need to be in wordList.
    sk == endWord

Given two words, beginWord and endWord, and a dictionary wordList, return the number of words in the shortest transformation sequence from beginWord to endWord, or 0 if no such sequence exists.

Example 1:

Input: beginWord = "hit", endWord = "cog", wordList = ["hot","dot","dog","lot","log","cog"]
Output: 5
Explanation: One shortest transformation sequence is "hit" -> "hot" -> "dot" -> "dog" -> cog", which is 5 words long.

A:

I will use BFS to solve this problem.

If the word is  one letter from the first word in the queue, it will be pushed into the queue.

Calculate the bfs tree level until find the end word.

class Solution {
    public int ladderLength(String beginWord, String endWord, List<String> wordList) {
        Queue<String> q = new LinkedList<String>();
        q.add(beginWord);
        boolean[] visited = new boolean[wordList.size()];
        int level = 1;
        while(!q.isEmpty()){
            level++;
            int size = q.size();
            while(size-- > 0){
                String s = q.poll();
                for(int i=0;i<wordList.size();i++){
                    String w = wordList.get(i);
                    if(!visited[i] && isRight(w,s)){
                        if(w.equals(endWord)) return level;
                        q.add(w);
                        visited[i] = true;
                    }
                }
            }
        }
        return  0;
    }

    boolean isRight(String a, String b){
        boolean flag = true;
        for(int i=0;i<a.length();i++){
            if(a.charAt(i)!=b.charAt(i)){
                if(flag){
                    flag = false;
                }else{
                    return false;
                }
            }
        }
        return !flag;
    }
}