Leetcode之word-ladder

题目描述：
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.

    /*

    解题思路：BFS
    队列：存放上一个可一步转化成字典中的单词
    HashMap<String,Integer>:存放该String与start的最短路径
    1.取出队头元素，将该单词的每个字母都进行替换并进行判断
    2.如果替换后到达end,返回其HashMaP的Integer
    3.如果替换后包含在字典中，入队列，放入HashMap中

    */
    public static int ladderLength(String start, String end, HashSet<String> dict) {
        if(start == null || end == null || dict.size() == 0 || start.equals(end) || start.length()!= end.length()){
            return 0;
        }
        if (isSimilar(start, end)) {
            return 2;
        }
        Queue<String> queue = new LinkedList<String>();
        Map<String, Integer> map = new HashMap<String, Integer>();
        queue.add(start);
        map.put(start, 1);
        while(!queue.isEmpty()){
            String head = queue.poll();
            int headDist = map.get(head);
            //替换每一位
            for(int i=0;i<head.length();i++){
                for(char c='a';c<='z';c++){
                    StringBuilder headBuilder = new StringBuilder(head);
                    headBuilder.setCharAt(i, c);
                    if(headBuilder.toString().equals(end))
                        return headDist + 1;
                    if(dict.contains(headBuilder.toString()) && !map.containsKey(headBuilder.toString())){
                        queue.add(headBuilder.toString());
                        map.put(headBuilder.toString(), headDist + 1);
                    }
                }
            }
        }
        return 0;
    }

    public static Boolean isSimilar(String a, String b) {
         int diff=0;
         for(int i=0;i<a.length();i++)
             {
             if(a.charAt(i)!=b.charAt(i))
                 {
                 diff++;
                 if(diff>=2)
                     return false;
             }
         }
        return diff==1;
    }