1362: 【中级组】南海群岛
Memory Limit:128 MB
Time Limit:1.000 S
Judge Style:Text Compare
Creator:
Submit:101
Solved:42
Description
南海群岛由很多岛屿组成,一张航拍的部分南海岛屿地图,经数字化网格处理后,只是由 '1'(陆地)和 '0'(水)组成的的二维网格(共有 i行与j列),请你计算网格中岛屿的数量。岛屿总是被水包围,并且每座岛屿只能由水平方向和/或竖直方向上相邻的陆地连接形成。
此外,你可以假设该网格的四条边均被水包围。
tle="" align="" />
示例 :
输入:
i=4, j=5 ;
grid[][] ={
{"0","1","0","1","1"},
{"1","1","1","0","0"},
{"1","1","0","0","1"},
{"0","1","0","1","1"}
};
输出:3
解释: 如上图示,存在三个岛屿。
此外,你可以假设该网格的四条边均被水包围。
tle="" align="" />
示例 :
输入:
i=4, j=5 ;
grid[][] ={
{"0","1","0","1","1"},
{"1","1","1","0","0"},
{"1","1","0","0","1"},
{"0","1","0","1","1"}
};
输出:3
解释: 如上图示,存在三个岛屿。
Input
输入第一行为 grid 两维数组的行数 i 及列数 j。以下 i 行为 grid 两维数组的每一行数据。数字间空格分隔。
Output
输出一个数,为存在多少个岛屿。
Sample Input Copy
4 5
0 1 0 1 1
1 1 1 0 0
1 1 0 0 1
0 1 0 1 1
Sample Output Copy
3
HINT
提示:
- 1 <= i , j <= 300
- grid[i][j] 的值为 '0' 或 '1'