【Medium】200. Number of Islands
来源:互联网 发布:蜜蜂对人类的作用数据 编辑:程序博客网 时间:2024/06/06 13:02
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+Recursion
如果一个格子是1,将其标为0后,查其上下左右,重复把查到的1标为0。当一个岛全为0后,recursion会停止,记住找到了一个岛,然后继续找地图中的下一个1.
class Solution {public: int numIslands(vector<vector<char>>& grid) { int n = grid.size(); if (n == 0){ return 0; } int m = grid[0].size(); int counter = 0; for (int i = 0; i < n; i++){ for (int j = 0; j < m; j++){ if (grid[i][j] == '1'){ grid[i][j] = '0'; counter++; search(i, j, grid); } } } return counter; } void search(int i, int j, vector<vector<char>>& grid){ int n = grid.size(); int m = grid[0].size(); if (grid[i][j] == '1') grid[i][j] = '0'; if (i > 0 && grid[i-1][j] == '1') search(i-1, j, grid); if (i < n-1 && grid[i+1][j] == '1') search(i+1, j, grid); if (j > 0 && grid[i][j-1] == '1') search(i, j-1, grid); if (j < m-1 && grid[i][j+1] == '1') search(i, j+1, grid); }};
0 0
- 【Medium】200. Number of Islands
- [Medium]Number of Islands
- [Leetcode 200, medium] Number of Islands
- [Leetcode 200, Medium] Number of Islands
- Medium 200题 Number of Islands
- 200. Number of Islands
- 200. Number of Islands
- 200. Number of Islands
- 200. Number of Islands
- 200. Number of Islands
- 200. Number of Islands
- 200. Number of Islands
- 200. Number of Islands
- 200. Number of Islands
- 200. Number of Islands
- 200. Number of Islands
- 200. Number of Islands
- 200. Number of Islands
- robotframework+selenium安装配置
- 解决虚拟机中Ubuntu的左边框和上边框消失问题
- RDD键值转换操作(4)–cogroup、join
- java中创建线程主要的三种方式
- Onenote 13与Windows 10冲突之解决方法
- 【Medium】200. Number of Islands
- Android 头像上传+图片裁切
- Neural Networks and Deep Learning 神经网络和深度学习
- VSS (Visual Source Safe 2005) 用法详解
- html+css+Javascript学习
- webview设置
- 读取XML文件
- RDD键值转换操作(5)–leftOuterJoin、rightOuterJoin、subtractByKey
- 极客班C++设计模式第二周课程笔记——常用模式(3)