【Lintcode】677. Number of Big Islands

题目地址：

https://www.lintcode.com/problem/number-of-big-islands/description

给定一个二维$0-1$矩阵，连通的$1$视为一个岛屿，返回面积大于等于给定$k$的岛屿数量。

思路是DFS，遍历岛屿的同时统计一下岛屿的大小最后返回，如果大于等于$k$则计入个数。代码如下：

public class Solution {
    /**
     * @param grid: a 2d boolean array
     * @param k: an integer
     * @return: the number of Islands
     */
    public int numsofIsland(boolean[][] grid, int k) {
        // Write your code here
        int[][] dirs = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
        int res = 0;
        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[0].length; j++) {
                if (grid[i][j]) {
                    res += dfs(i, j, grid, dirs) >= k ? 1 : 0;
                }
            }
        }
        
        return res;
    }
    
    private int dfs(int x, int y, boolean[][] grid, int[][] dirs) {
        int size = 1;
        // 遍历过了标记为false
        grid[x][y] = false;
        for (int i = 0; i < dirs.length; i++) {
            int nextX = x + dirs[i][0], nextY = y + dirs[i][1];
            if (isValid(nextX, nextY, grid)) {
                size += dfs(nextX, nextY, grid, dirs);
            }
        }
        
        return size;
    }
    
    private boolean isValid(int x, int y, boolean[][] grid) {
        return 0 <= x && x < grid.length && 0 <= y && y < grid[0].length && grid[x][y];
    }
}

时空复杂度$O(mn)$。空间复杂度主要是递归栈深度，最差有可能深度达到$mn$但概率比较小。