[leetcode]130. Surrounded Regions-200. Number of Islands-695. Max Area of Island-举一反三

都是采用遍历修改的办法，无需还原现场

695. Max Area of Island

class Solution:    

    def judge(self, x:int, y:int)->bool:           
        if(x < n and y < m and x > -1 and y > -1):
            return True
        return False

    def maxAreaOfIsland(self, grid: List[List[int]]) -> int:
        global n,m
        if(not grid):
            return 0
        m,n = len(grid[0]), len(grid)   
        self.maxn = 0    
        self.t = 0
        def change(x:int, y:int) -> None:
            dist = [[0,-1],[-1,0],[1,0],[0,1]]
            grid[x][y] = 0            
            self.t += 1
            self.maxn = max(self.maxn,self.t)
            for i in range(4):
                cur_x = x + dist[i][0]
                cur_y = y + dist[i][1]
                if(self.judge(cur_x,cur_y) and grid[cur_x][cur_y] == 1):
                    change(cur_x, cur_y)
            return    

        for i in range(n):
            for j in range(m):
                if(grid[i][j] == 1): 
                    self.t = 0                   
                    change(i,j)                    
        return self.maxn

130. Surrounded Regions

class Solution:
    def judge(self, x:int, y:int)->bool:
        if(x < n and y < m and x > -1 and y > -1):
            return True
        return False

    def solve(self, board: List[List[str]]) -> None:                        
        global n,m,boa
        if(len(board) == 0 or len(board[0]) == 0):
            return
        m,n = len(board[0]), len(board)

        def change(x:int, y:int) -> None:
            dist = [[0,-1],[-1,0],[1,0],[0,1]]
            board[x][y] = '1'     
            for i in range(4):
                cur_x = x + dist[i][0]
                cur_y = y + dist[i][1]
                if(self.judge(cur_x,cur_y) and board[cur_x][cur_y] == 'O'):
                    change(cur_x, cur_y)
            return
        for i in range(n):
            if(board[i][0] == 'O'):
                change(i,0)                
            if(board[i][m-1] == 'O'):
                change(i,m-1)                                 
        for i in range(m):
            if(board[0][i] == 'O'):
                change(0,i)                
            if(board[n-1][i] == 'O'):
                change(n-1,i)                
        for i in range(n):
            for j in range(m):
                if(board[i][j] == '1'):
                    board[i][j] = 'O'
                else:
                    board[i][j] = 'X'

200. Number of Islands

class Solution:
    def judge(self, x:int, y:int)->bool:
        if(x < n and y < m and x > -1 and y > -1):
            return True
        return False

    def numIslands(self, grid: List[List[str]]) -> int:
        global n,m
        if(len(grid) == 0 or len(grid[0]) == 0):
            return 0
        m,n = len(grid[0]), len(grid)
        def change(x:int, y:int) -> None:
            dist = [[0,-1],[-1,0],[1,0],[0,1]]
            grid[x][y] = '0'     
            for i in range(4):
                cur_x = x + dist[i][0]
                cur_y = y + dist[i][1]
                if(self.judge(cur_x,cur_y) and grid[cur_x][cur_y] == '1'):
                    change(cur_x, cur_y)
            return
        num = 0
        for i in range(n):
            for j in range(m):
                if(grid[i][j] == '1'):
                    num += 1
                    change(i,j)  
        return num