給定一個由
'1'
(陸地)和
'0'
(水)組成的的二維網格,計算島嶼的數量。一個島被水包圍,并且它是通過水準方向或垂直方向上相鄰的陸地連接配接而成的。你可以假設網格的四個邊均被水包圍。
示例 1:
輸入:
11110
11010
11000
00000
輸出: 1
class Solution(object):
def numIslands(self, grid):
row = len(grid)
if row == 0 or grid == None:
return 0
col = len(grid[0])
count = 0
for i in range(row):
for j in range(col):
if grid[i][j] == 1:
self.dfsFind(grid, i, j, row, col)
count += 1
return count
def dfsFind(self, grid, i, j, row, col):
if grid[i][j] == 1:
grid[i][j] = 0
if i - 1 >= 0:
grid = self.dfsFind(grid, i - 1, j, row, col)
if i + 1 < row:
grid = self.dfsFind(grid, i + 1, j, row, col)
if j - 1 >= -0:
grid = self.dfsFind(grid, i, j - 1, row, col)
if j + 1 < col:
grid = self.dfsFind(grid, i, j + 1, row, col)
return grid