leetcode岛屿问题

leetcode200岛屿数量
分析：
典型的岛屿之类的问题，代码框架应是
① inArea() 方法，判断点是否在区域内部
② dfs() 方法，递归函数，要对上下左右4个方向进行递归调用，同时对已访问的格子进行标记
③ 已给出的主成员方法，通过双重for循环，调用dfs() 方法

解答：

/**
 * 算法：递归回溯、dfs、flood fill
 */
class Solution {

    boolean inArea(char[][] grid, int i, int j) { // 判断点是否在区域内
        return i >= 0 && i < grid.length && j >= 0 && j < grid[0].length;
    }

    void dfs(char[][] grid, int i, int j) { // 递归函数，深度优先遍历，flood fill算法

        if( !inArea(grid, i, j) ) { // 不在区域内，递归终止，返回
            return;
        }

        if(grid[i][j] != '1') {   // 不是岛屿或者已经被遍历过，递归终止，返回
            return;
        }
        grid[i][j] = '2'; // 标记已被访问过

        dfs(grid, i + 1, j);
        dfs(grid, i, j + 1);
        dfs(grid, i - 1, j);
        dfs(grid, i, j - 1);
    }

    public int numIslands(char[][] grid) {
        int res = 0;
        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[0].length; j++) {
                if(grid[i][j] == '1') {
                    res ++;
                    dfs(grid, i, j);
                }
            }
        }
        return res;
    }

    public static void main(String[] args) {
        char[][] grid = {
                {'1', '1', '0', '0', '0'},
                {'1', '1', '0', '0', '0'},
                {'0', '0', '1', '0', '0'},
                {'0', '0', '0', '1', '1'}};

        System.out.println(new Solution().numIslands(grid));
    }
}

leetcode695岛屿的最大面积

class Solution {

    private boolean inArea(int[][] grid, int i, int j) {
        return i >= 0 && i < grid.length && j >= 0 && j < grid[0].length;
    }

    private int dfs(int[][] grid, int i, int j) {

        if( !inArea(grid, i, j) ) {
            return 0;
        }

        if(grid[i][j] != 1) {
            return 0;
        }

        grid[i][j] = 2;
        return 1 +  dfs(grid, i + 1, j) + dfs(grid, i, j + 1) + dfs(grid, i - 1, j) + dfs(grid, i, j - 1);
    }

    public int maxAreaOfIsland(int[][] grid) {
        int res = 0;
        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[0].length; j++) {
                if(grid[i][j] == 1) {
                    int a = dfs(grid, i, j);
                    res = Math.max(res, a);
                }
            }
        }
        return res;
    }

    public static void main(String[] args) {
        int[][] grid = {
                {0,0,1,0,0,0,0,1,0,0,0,0,0},
                {0,0,0,0,0,0,0,1,1,1,0,0,0},
                {0,1,1,0,1,0,0,0,0,0,0,0,0},
                {0,1,0,0,1,1,0,0,1,0,1,0,0},
                {0,1,0,0,1,1,0,0,1,1,1,0,0},
                {0,0,0,0,0,0,0,0,0,0,1,0,0},
                {0,0,0,0,0,0,0,1,1,1,0,0,0},
                {0,0,0,0,0,0,0,1,1,0,0,0,0}};

        System.out.println(new Solution().maxAreaOfIsland(grid));
    }
}

leetcode463岛屿的周长

class Solution {

    private boolean inArea(int[][] grid, int i, int j) {
        return i >= 0 && i < grid.length && j >= 0 && j < grid[0].length;
    }

    private int dfs(int[][] grid, int i, int j) {
        if(!inArea(grid, i, j)) {   // 函数因为「坐标 (r, c) 超出网格范围」返回1
            return 1;
        }
        if(grid[i][j] == 0) {   // 函数因为「当前格子是海洋格子」返回1
            return 1;
        }
        if(grid[i][j] == 2) {   // 函数因为「当前格子是已遍历的陆地格子」返回，和周长没关系
            return 0;
        }
        grid[i][j] = 2;
        return dfs(grid, i - 1, j) + dfs(grid, i + 1, j) + dfs(grid, i, j - 1) + dfs(grid, i, j + 1);
    }

    public int islandPerimeter(int[][] grid) {
        int res = 0;
        for (int i = 0; i < grid.length; i ++) {
            for (int j = 0; j < grid[0].length; j ++) {
                if(grid[i][j] == 1) {    // 题目限制只有一个岛屿，计算一个即可
                    return dfs(grid, i, j);
                }
            }
        }
        return res;
    }

    public static void main(String[] args) {
        int[][] grid = {{0,1,0,0},
                        {1,1,1,0},
                        {0,1,0,0},
                        {1,1,0,0}};
        System.out.println(new Solution().islandPerimeter(grid));
    }
}