BFS或DFS,利用grid数组来标记是否访问。代码如下:
int numIslands(vector<vector<char>> &grid) {
if(grid.empty())
return 0;
const int m = grid.size();
const int n = grid[0].size();
int dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int result = 0;
stack<pair<int, int> > s;
for(int i = 0; i < m; ++i){
for(int j = 0; j < n; ++j){
if(grid[i][j] != '1')
continue;
s.push(make_pair(i, j));
while(!s.empty()){
pair<int, int> cur = s.top();
s.pop();
for(int d = 0; d < 4; ++d){
pair<int, int> p(cur.first + dir[d][0], cur.second + dir[d][1]);
if(p.first >= 0 && p.first < m && p.second >= 0 && p.second < n && grid[p.first][p.second] == '1')
s.push(p);
}
grid[cur.first][cur.second] = '2';
}
++result;
}
}
return result;
}