130.被包围的区域python实现

**题目描述：**给定一个二维的矩阵，包含 ‘X’ 和 ‘O’（字母 O）。找到所有被 ‘X’ 围绕的区域，并将这些区域里所有的 ‘O’ 用 ‘X’ 填充。

解题思路：

参考别人的思路，用dfs写了以下代码，遇到了一些坑。。

class Solution(object):
    def solve(self, board):
        """
        :type board: List[List[str]]
        :rtype: None Do not return anything, modify board in-place instead.
        """
        #从四条边上的O出发，用DFS把所有相邻的O变成‘P’
        #再遍历数组，把O变成X，再把‘P’变成O
        if not board or not board[0]:
            return board
        
        m, n = len(board), len(board[0])
        dx = [1, -1, 0, 0]
        dy = [0, 0, 1, -1]


        def dfs(x0, y0):
            for k in range(4):
                x = x0 + dx[k]
                y = y0 + dy[k]

                if 0 <= x < m and 0 <= y < n and board[x][y] == "O":
                    board[x][y] = "P"
                    dfs(x, y)
           
        #[0, m-1] 和[0, n - 1]是个list，表示边界
        # for i in [0, m - 1]:
        #     for j in range(n):
        #         if board[i][j] == "O":
        #             board[i][j] = "P"
        #             dfs(i, j) 
        
        # for j in [0, n - 1]:
        #     for i in range(m):
        #         if board[i][j] == "O":
        #             board[i][j] = "P"
        #             dfs(i, j)
        for i in range(m):
            for j in range(n):
                if board[i][j] == "O":
                    if i == 0 or i == m - 1 or j == 0 or j == n - 1:
                        board[i][j] = "P"
                        dfs(i, j)

        for i in range(m):
            for j in range(n):
                if board[i][j] == "O":
                    board[i][j] = "X"
                elif board[i][j] == "P":
                    board[i][j] = "O"

看别人在处理边界时，用到的两个循环，for i in [0, m -1]和for i in [0, n - 1],一开始一直把[0, m -1]当成类似range(0, m)这样的范围区间，，死活调了半个多小时通不过，后来怎么才发现[0, m -1]是个list,，只包含0和m-1两个数。。。。我太难了。。。。后来终于搞清楚了，自己写了一个循环，搞定边界处理。还是要编程基础扎实啊。。。

for i in range(m):
            for j in range(n):
                if board[i][j] == "O":
                    if i == 0 or i == m - 1 or j == 0 or j == n - 1:
                        board[i][j] = "P"
                        dfs(i, j)