首页 > 代码库 > [leetcode-200-Number of Islands]
[leetcode-200-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:
11110
11010
11000
00000
Answer: 1
Example 2:
11000
11000
00100
00011
Answer: 3
思路：
DFS,用一个标记visited数组记录。
void dfsisland(vector<vector<char>>& grid, vector<vector<bool>>& visited,int i,int j) { int m = grid.size(), n = grid[0].size(); if (i < 0 || i >= m || j < 0 || j >= n || visited[i][j] || grid[i][j] == ‘0‘)return; visited[i][j] = true; dfsisland(grid, visited, i + 1, j); dfsisland(grid, visited, i - 1, j); dfsisland(grid, visited, i, j + 1); dfsisland(grid, visited, i, j - 1); } int numIslands(vector<vector<char>>& grid) { if (grid.empty())return 0; int m = grid.size(), n = grid[0].size(); vector<vector<bool>>visited(m, vector<bool>(n, false)); int ret = 0; for (int i = 0; i < m;i++) { for (int j = 0; j < n;j++) { if (grid[i][j] == ‘1‘ && !visited[i][j]) { dfsisland(grid, visited,i,j); ret++; } } } return ret; }
[leetcode-200-Number of Islands]
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。