例题 一 :岛屿数量(力扣 200 中等)
题目链接:
200. 岛屿数量 - 力扣(LeetCode) (leetcode-cn.com)https://leetcode-cn.com/problems/number-of-islands/
题目:给你一个由'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
- gride[i][j]的值为'0'或'1'
题目分析:题目的意思可以理解为统计连续(上下左右相邻)的'1'的个数,可以先找到'1',然后通过dfs将‘1’附近的‘1’改为‘0’,并计数。
代码:
class Solution {
public:
void dfs(vector<vector<char>>& nums, int x, int y)
{
int n = nums.size(), m = nums[0].size();
if(x < 0 || y < 0 || x >= n || y >= m || nums[x][y] == '0') return;
nums[x][y] = '0';
dfs(nums, x - 1, y), dfs(nums, x + 1, y), dfs(nums, x, y - 1), dfs(nums, x, y + 1);
}
int numIslands(vector<vector<char>>& grid) {
int cnt = 0, n = grid.size(), m = grid[0].size();
for(int i = 0; i < n; i ++)
for(int j = 0; j < m; j ++)
{
if(grid[i][j] == '1')
{
cnt ++;
dfs(grid, i, j);
}
}
return cnt;
}
};
例题 2:被围绕的区域(力扣 130 中等)
题目链接:130. 被围绕的区域 - 力扣(LeetCode) (leetcode-cn.com)https://leetcode-cn.com/problems/surrounded-regions/
题目:给你一个m X n的矩阵board,由若干字符'X'和'O',找到所有被'X'围绕的区域,并将这些区域里所有的'O'用'X'填充。
示例 1:
输入:board = [["X","X","X","X"],["X","O","O","X"],["X","X","O","X"],["X","O","X","X"]]
输出:[["X","X","X","X"],["X","X","X","X"],["X","X","X","X"],["X","O","X","X"]]
解释:被围绕的区间不会存在于边界上,换句话说,任何边界上的 'O' 都不会被填充为 'X'。 任何不在边界上,或不与边界上的 'O' 相连的 'O' 最终都会被填充为 'X'。如果两个元素在水平或垂直方向相邻,则称它们是“相连”的。
示例 2:
输入:board = [["X"]]
输出:[["X"]]
提示:
- m == board.length
- n == board[i].length
- 1 <= m, n <= 200
- board[i][j]为'X'或'O'
题目分析:将除边缘附近(上下左右相邻)的'O'改为‘X’,对边缘的'O'进行dfs,将其相邻的'O'改为‘A’(这里任选,除‘X’和‘O’外都可以),然后通过循环将'O'改为‘X’,将‘A’改为‘O’,这里的先后顺序不能更改。
代码:
class Solution {
public:
void dfs(vector<vector<char>>& board, int x, int y)
{
int n = board.size(), m = board[0].size();
if(x < 0 || y < 0 || x >= n || y >= m || board[x][y] != 'O') return;
board[x][y] = 'A';
dfs(board, x, y + 1), dfs(board, x, y - 1), dfs(board, x- 1, y), dfs(board, x + 1, y);
}
void solve(vector<vector<char>>& board) {
int n = board.size(), m = board[0].size();
for(int i = 0; i < n; i ++)
{
if(board[i][0] == 'O')
dfs(board, i, 0);
if(board[i][m - 1] == 'O')
dfs(board, i, m - 1);
}
for(int i = 0; i < m; i ++)
{
if(board[0][i] == 'O')
dfs(board, 0, i);
if(board[n - 1][i] == 'O')
dfs(board, n - 1, i);
}
for(int i = 0; i < n; i ++)
{
for(int j = 0; j < m; j ++)
if(board[i][j] == 'O')
board[i][j] = 'X';
}
for(int i = 0; i < n; i ++)
for(int j = 0; j < m; j ++)
if(board[i][j] == 'A')
board[i][j] = 'O';
}
};
总结:
大部分的dfs的模板
void dfs(vector<vector<int>>& nums, int x, int y)
{
int n = nums.size(), m = nums[0].size();
if( x < 0 || y < 0 || x >= n || y >= m || } return;
dfs(nums, x - 1, y), dfs(nums, x + 1, y), dfs(nums, x, y - 1), dfs(nums, x, y + 1);
}
一般简单的dfs是通过递归的方式对二位数组进行改变。