标签：++ 复杂 搜索 res nbsp mit edit creat http
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
Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.
解题思路：用了暴力搜索，不过复杂度也是O(n)的
class Solution { public: void dfs(int x,int y,int n,int m,vector<vector<char>>& grid){ if(x<0||x>=n||y<0||y>=m||vis[x][y]||grid[x][y]==‘0‘)return; vis[x][y]=1; dfs(x+1,y,n,m,grid);dfs(x,y+1,n,m,grid);dfs(x,y-1,n,m,grid);dfs(x-1,y,n,m,grid); } int numIslands(vector<vector<char>>& grid) { if(grid.empty())return 0; int ans=0; int n=grid.size(),m=grid[0].size(); vis.resize(n+1); for(int i=0;i<n;i++) vis[i].resize(m+1); for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ if((!vis[i][j])&&grid[i][j]==‘1‘){ dfs(i,j,n,m,grid); ans++; } } } return ans; } private: vector<vector<int>>vis; };
标签：++ 复杂 搜索 res nbsp mit edit creat http
原文地址：http://www.cnblogs.com/tsunami-lj/p/7617561.html
