leetcode200 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:
Input:
11110
11010
11000
00000
Output: 1
Example 2:
Input:
11000
11000
00100
00011
Output: 3
"""
"""
本题与1162，542 类似
有BFS,和DFS两种做法，
解法一：BFS
我个人更习惯BFS的做法
"""
class Solution1:
    def numIslands(self, grid):
        if not grid or not grid[0]:
            return 0
        queue = []
        res = 0
        m = len(grid)
        n = len(grid[0])
        for x in range(m):
            for y in range(n):
                if grid[x][y] == '1':
                    res += 1
                    grid[x][y] == '0' #!!!找到为1的，将其变为0，并从四个方向遍历，把整个岛变为0
                    queue.append((x, y))
                    while queue:
                        a, b = queue.pop()
                        for i, j in [(a+1, b), (a-1, b), (a, b-1), (a, b+1)]:
                            if 0 <= i < m and 0 <= j < n and grid[i][j] == '1':
                                grid[i][j] = '0'
                                queue.append((i, j))
        return res

"""
我们对每个有“1"的位置进行dfs，把和它四联通的位置全部变成“0”，这样就能把一个点推广到一个岛。
所以，我们总的进行了dfs的次数，就是总过有多少个岛的数目。
注意理解dfs函数的意义：已知当前是1，把它周围相邻的所有1全部转成0.
"""
class Solution2:
    def numIslands(self, grid):
        if not grid or not grid[0]:
            return 0
        queue = []
        res = 0
        m = len(grid)
        n = len(grid[0])
        for x in range(m):
            for y in range(n):
                if grid[x][y] == '1':
                    self.dfs(grid, x, y)
                    res += 1
        return res

    def dfs(self, grid, a, b):
        grid[a][b] = 0
        for i, j in [(a + 1, b), (a - 1, b), (a, b - 1), (a, b + 1)]:
            if 0 <= i < len(grid) and 0 <= j < len(grid[0]) and grid[i][j] == '1':
                self.dfs(grid, i, j)