[leetcode] 200. Number of Islands
来源:互联网 发布:js分页代码 编辑:程序博客网 时间:2024/06/04 16:00
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
这道题是统计小岛的个数,题目难度为Medium。
针对grid[i][j],如果是‘1’,表明已经进入一个小岛,将小岛数加一并把grid[i][j]修改为‘0’以表示这个点已统计过,然后依次查看和它相邻的四个点,如果是‘1’,将其变为‘0’,因为这个点和grid[i][j]在一个岛上,然后再依次搜索和他们相邻的点,直至所有相邻的点都是‘0’,这样一个完整的小岛就遍历完了,所有的点都从‘1’变为了‘0’。以上方法即所谓的深度优先搜索策略。具体代码:
class Solution { void reduceSameIsland(vector<vector<char>>& grid, int i, int j) { if(i<0 || i>=grid.size() || j<0 || j>=grid[i].size() || grid[i][j]=='0') return; grid[i][j] = '0'; reduceSameIsland(grid, i-1, j); reduceSameIsland(grid, i+1, j); reduceSameIsland(grid, i, j-1); reduceSameIsland(grid, i, j+1); }public: int numIslands(vector<vector<char>>& grid) { int cnt = 0; for(int i=0; i<grid.size(); i++) { for(int j=0; j<grid[i].size(); j++) { if(grid[i][j] == '1') { cnt++; reduceSameIsland(grid, i, j); } } } return cnt; }};还可以通过广度优先的策略进行处理,针对grid[i][j],如果为‘1’,将其修改为‘0’,然后将和它相邻的四个点中为‘1’的点存入队列,这样依次遍历,直至队列为空,一个小岛就处理完了。具体代码:
class Solution { void reduceSameIsland(vector<vector<char>>& grid, int i, int j) { queue<int> idx; int col = grid[0].size(); grid[i][j] = '0'; idx.push(i*col+j); while(!idx.empty()) { int sz = idx.size(); for(int k=0; k<sz; k++) { int index = idx.front(); int m = index/col; int n = index%col; idx.pop(); if(m-1>=0 && grid[m-1][n]=='1') { grid[m-1][n] = '0'; idx.push(index-col); } if(m+1<grid.size() && grid[m+1][n]=='1') { grid[m+1][n] = '0'; idx.push(index+col); } if(n-1>=0 && grid[m][n-1]=='1') { grid[m][n-1] = '0'; idx.push(index-1); } if(n+1<col && grid[m][n+1]=='1') { grid[m][n+1] = '0'; idx.push(index+1); } } } }public: int numIslands(vector<vector<char>>& grid) { int cnt = 0; for(int i=0; i<grid.size(); i++) { for(int j=0; j<grid[0].size(); j++) { if(grid[i][j] == '1') { cnt++; reduceSameIsland(grid, i, j); } } } return cnt; }};
0 0
- [LeetCode]200.Number of Islands
- LeetCode 200. Number of Islands
- [leetcode] 200.Number of Islands
- 【leetcode】 200. Number of Islands
- [leetcode] 200. Number of Islands
- Leetcode 200. Number of Islands
- 200. Number of Islands LeetCode
- leetcode 200. Number of Islands
- LeetCode 200. Number of Islands
- leetcode.200. Number of Islands
- LeetCode 200. Number of Islands
- LeetCode-200.Number of Islands
- LeetCode - 200. Number of Islands
- [leetcode] 200. Number of Islands
- [LeetCode] 200. Number of Islands
- 【LeetCode】200. Number of Islands
- LeetCode 200. Number of Islands
- [LeetCode]200. Number of Islands
- 嵌入式学习的一些个人理解
- 给Dataset增加行数据
- Mac OS X上使用XCode编译调用OS X的动态库
- 在Ubuntu下解决 adb devices :???????????? no permissions 方法
- 【JavaScript】JavaScript中的封装继承多态
- [leetcode] 200. Number of Islands
- C++primer学习:标准库特殊设施:正则表达式基础
- UIButton文字位置显示
- JS实现Office在线编辑和浏览(实用)
- 让字体变的更清晰CSS 中 -webkit-font-smoothing
- poj2479 Maximum sum(最大子段和变形)
- asp连接acess数据库出现 Microsoft JET Database Engine 错误 '80004005
- 如何生成验证码图片代码实现
- java.sql.SQLException: Access denied for user 'XXX'@'localhost' (using password: YES)