算法学习（九）之“宽度优先搜索”

什么是宽度优先搜索？

面试题：

1. 小岛问题
   题目：
   给你一个由 ‘1’（陆地）和 ‘0’（水）组成的的二维网格，请你计算网格中岛屿的数量。
   岛屿总是被水包围，并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。
   此外，你可以假设该网格的四条边均被水包围。

   示例1：

   输入：grid = [
   [“1”,“1”,“1”,“1”,“0”],
   [“1”,“1”,“0”,“1”,“0”],
   [“1”,“1”,“0”,“0”,“0”],
   [“0”,“0”,“0”,“0”,“0”]
   ]
   输出：1

   示例2

   输入：grid = [
   [“1”,“1”,“0”,“0”,“0”],
   [“1”,“1”,“0”,“0”,“0”],
   [“0”,“0”,“1”,“0”,“0”],
   [“0”,“0”,“0”,“1”,“1”]
   ]
   输出：3

   提示：

   • m == grid.length
   • n == grid[i].length
   • 1 <= m, n <= 300
   • grid[i][j] 的值为 ‘0’ 或 ‘1’

图示：
代码：

class Solution {
    public int numIslands(char[][] grid) {
        if(grid == null || grid.length == 0) {
            return 0;
        }
        if (grid[0] == null || grid[0].length == 0) {
            return 0;
        }
        int row = grid.length;
        int column = grid[0].length;
        boolean[][] visited = new boolean[row][column];
        int number = 0;
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < column; j++) {
                if (grid[i][j] == '1' && !visited[i][j]) {
                    bfs(grid, i, j, visited);
                    number++;
                }
            }
        }
        return number;
    }
    
    public void bfs(char[][] grid, int i, int j, boolean[][] visited) {
        int[] kx ={1, -1, 0, 0};
        int[] ky ={0, 0, 1, -1};
        visited[i][j] = true;
        Queue<Integer> xQueue = new LinkedList<>();
        Queue<Integer> yQueue = new LinkedList<>();
        xQueue.offer(i);
        yQueue.offer(j);
        while (!xQueue.isEmpty()) {
            int currentX = xQueue.poll();
            int currentY = yQueue.poll();
            for (int k = 0; k < 4; k++) {
                int newX = currentX + kx[k];
                int newY = currentY + ky[k];
                if (newX >= 0 && newY >= 0 && newX < grid.length && newY < grid[0].length && !visited[newX][newY]) {
                    if (grid[newX][newY] == '1') {
                        xQueue.offer(newX);
                        yQueue.offer(newY);
                        visited[newX][newY] = true;
                    }
                }
            }
        }
    }
}

2. 单词梯
   题目：
   图示：
   代码：

public class Solution {
    /*
     * @param start: a string
     * @param end: a string
     * @param dict: a set of string
     * @return: An integer
     */
    public int ladderLength(String start, String end, Set<String> dict) {
        // write your code here
        int steps = 1;
        if (dict == null) {
            return 0;
        }
        dict.add(end);
        Queue<String> queue = new LinkedList<>();
        queue.offer(start);
        Set<String> duplicate = new HashSet<>();
        duplicate.add(start);
        while (!queue.isEmpty()) {
            int size = queue.size();
            steps++;
            for (int i = 0; i < size; i++) {
                String word = queue.poll();
                List<String> nextWords = getNext(word, dict);
                for (String next: nextWords) {
                    if (duplicate.contains(next)) {
                        continue;
                    }
                    if (next.equals(end)) {
                        return steps;
                    }
                    duplicate.add(next);
                    queue.offer(next);
                }
            }
        }
        return -1;
    }
    
    public List<String> getNext(String word, Set<String> dict) {
        List<String> next = new ArrayList<>();
        for (char i = 'a'; i <= 'z'; i++) {
            for (int j = 0; j < word.length(); j++) {
                String potentialNext = changedWord(word, i, j);
                if (dict.contains(potentialNext)) {
                    next.add(potentialNext);
                }
            }
        }
        return next;
    }
    
    public String changedWord(String word, char c, int i) {
        char[] words = word.toCharArray();
        words[i] = c;
        return new String(words);
    }
    
}