LeetCode 200. Number of Islands

转载

mb5fe190f8e35a0 2015-10-17 08:45:00

文章标签 LeetCode Array DFS Union Find BFS 文章分类 C/C++ 后端开发

原题链接在这里：https://leetcode.com/problems/number-of-islands/

题目：

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:

Answer: 1

Example 2:

Answer: 3

题解：

若是碰到一个1, 用DFS把与它相连的1 都换成0. 继续扫描，最后算出能有多少个单独的 1.

Time Complexity: O(m*n), m = grid.length, n = grid[0].length. 看起来像 O(m^2 * n^2), 对于每一个点做DFS 用O(m*n). 一共m*n个点，其实每个点最多扫描两遍。

Space: O(m*n) 最多可以有O(m*n)层 stack.

AC Java:

 1 public class Solution {
 2     public int numIslands(char[][] grid) {
 3         if(grid == null || grid.length == 0 || grid[0].length == 0){
 4             return 0;
 5         }
 6         int res = 0;
 7         for(int i = 0; i<grid.length; i++){
 8             for(int j = 0; j<grid[0].length; j++){
 9                 if(grid[i][j] == '1'){
10                     res++;
11                     replace(grid,i,j);
12                 }
13             }
14         }
15         return res;
16     }
17     private void replace(char[][] grid, int i, int j){
18         if(i<0 || i>=grid.length || j<0 || j>=grid[0].length || grid[i][j] != '1'){
19             return;
20         }
21         grid[i][j] = '0';
22         replace(grid,i-1,j);
23         replace(grid,i+1,j);
24         replace(grid,i,j-1);
25         replace(grid,i,j+1);
26     }
27 }

也可以使用BFS.

Time Complexity: O(m*n).

Space: O(m*n).

AC Java:

 1 class Solution {
 2     public int numIslands(char[][] grid) {
 3         if(grid == null || grid.length == 0 || grid[0].length == 0){
 4             return 0;
 5         }
 6         
 7         int m = grid.length;
 8         int n = grid[0].length;
 9         int count = 0;
10         int [][] dirs = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
11         
12         for(int i = 0; i<m; i++){
13             for(int j = 0; j<n; j++){
14                 if(grid[i][j] == '1'){
15                     count++;
16                     LinkedList<int []> que = new LinkedList<int []>();
17                     que.add(new int[]{i, j});
18                     while(!que.isEmpty()){
19                         int [] cur = que.poll();
20                         for(int [] dir : dirs){
21                             int p = cur[0]+dir[0];
22                             int q = cur[1]+dir[1];
23                             if(p>=0 && p<m && q>=0 && q<n && grid[p][q]=='1'){
24                                 grid[p][q] = '0';
25                                 que.add(new int[]{p,q});
26                             }
27                         }
28                     }
29                 }
30             }
31         }
32         
33         return count;
34     }
35 }