Number of Islands
Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return 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:
Input: grid = [
["1","1","1","1","0"],
["1","1","0","1","0"],
["1","1","0","0","0"],
["0","0","0","0","0"]
]
Output: 1
Example 2:
Input: grid = [
["1","1","0","0","0"],
["1","1","0","0","0"],
["0","0","1","0","0"],
["0","0","0","1","1"]
]
Output: 3
from collections import deque
class Solution:
def numIslands(self, grid: List[List[str]]) -> int:
count = 0
for i in range(len(grid)):
for j in range(len(grid[0])):
if grid[i][j] == '1':
#print(i,j,grid)
grid[i][j] = '0'
self.helper(grid,i,j)
count += 1
return count
# use a helper function to flip connected '1's to 0
def helper(self,grid,i,j):
queue = deque([(i,j)])
while queue:
I,J = queue.popleft()
for i,j in [I+1,J],[I,J+1],[I-1,J],[I,J-1]:
if 0 <= i < len(grid) and 0 <= j < len(grid[0]) and grid[i][j] == '1':
#print(i,j, queue)
grid[i][j] = '0'
queue.append((i,j))Posted by Jamie Meyer 21 days ago