leetCode---Number of Islands

最新推荐文章于 2020-09-02 22:10:56 发布

jingxichen_

最新推荐文章于 2020-09-02 22:10:56 发布

阅读量186

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/jingxichen_/article/details/73275212

版权

LeetCode 专栏收录该内容

34 篇文章 0 订阅

订阅专栏

一. 题目：Number of Islands

Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

Example 1:

Answer: 1

Example 2:

Answer: 3

二. 思路分析

题目大意：对每次出现'1'的区域进行计数，问有多少个连成一片的1区域。思路比较简单：可以借助DFS的思想,每遇到'1'后, 开始向四个方向递归搜索. 搜到后访问标志变为'true', 因为相邻的属于一个island. 然后开始继续找下一个'1'.

class Solution {
public:
    int numIslands(vector<vector<char>> &grid) {
        if (grid.empty() || grid[0].empty()) return 0;
        int m = grid.size(), n = grid[0].size(), res = 0;
        vector<vector<bool>> visited(m, vector<bool>(n, false));
        for (int i = 0; i < m; ++i) {
            for (int j = 0; j < n; ++j) {
                if (grid[i][j] == '1' && !visited[i][j]) {
                    dfs(grid, visited, i, j);
                    ++res;
                }
            }
        }
        return res;
    }
    void dfs(vector<vector<char>> &grid, vector<vector<bool>> &visited, int x, int y) {
        if (x < 0 || x >= grid.size()) return;
        if (y < 0 || y >= grid[0].size()) return;
        if (grid[x][y] != '1' || visited[x][y]) return;
        visited[x][y] = true;
        dfs(grid, visited, x - 1, y);
        dfs(grid, visited, x + 1, y);
        dfs(grid, visited, x, y - 1);
        dfs(grid, visited, x, y + 1);
    }
};