# LeetCode Number of Islands

125人阅读 评论(0)

Description:

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:

11110110101100000000

Example 2:

11000110000010000011

Solution:

import java.util.*;

public class Solution {
int m, n;
int dir[][] = new int[][] { { 1, 0 }, { 0, 1 }, { 0, -1 }, { -1, 0 } };

public int numIslands(char[][] grid) {
this.m = grid.length;
if (m == 0)
return 0;
this.n = grid[0].length;

int a, b, da, db;

int count = 0;
for (int i = 0; i < m; i++)
for (int j = 0; j < n; j++) {
if (grid[i][j] != '1')
continue;
grid[i][j] = '0';
count++;
while (!mList.isEmpty()) {
a = mList.poll();
b = nList.poll();

for (int k = 0; k < 4; k++) {
da = a + dir[k][0];
db = b + dir[k][1];
if (valid(grid, da, db)) {
grid[da][db] = '0';
}
}
}
}

return count;
}

boolean valid(char[][] grid, int a, int b) {
if (a < 0 || a >= m)
return false;
if (b < 0 || b >= n)
return false;
if (grid[a][b] == '1')
return true;
return false;
}

public static void main(String[] args) {
Solution s = new Solution();
System.out.println(5 & 6 & 7);
}
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：62560次
• 积分：3261
• 等级：
• 排名：第10448名
• 原创：288篇
• 转载：0篇
• 译文：0篇
• 评论：4条
文章分类
阅读排行
最新评论