101. 孤岛的总面积
基础题目 可以自己尝试做一做 。代码随想录
把处于边界上的岛屿全部消除，剩下的就是孤岛
direction=[[0,1],[0,-1],[1,0],[-1,0]]
count=0
def dfs(grid,x,y):global countgrid[x][y]=0count+=1for i,j in direction:next_x=x+inext_y=y+jif next_x<0 or next_x>=len(grid) or next_y<0 or next_y>=len(grid[0]):continueif grid[next_x][next_y]==1:dfs(grid,next_x,next_y)if __name__=='__main__':n,m=map(int,input().split())grid=[]for i in range(n):grid.append(list(map(int,input().split())))for i in range(n):if grid[i][0]==1:dfs(grid,i,0)if grid[i][m-1]==1:dfs(grid,i,m-1)for j in range(m):if grid[0][j]==1:dfs(grid,0,j)if grid[n-1][j]==1:dfs(grid,n-1,j)count=0for i in range(n):for j in range(m):if grid[i][j]==1:dfs(grid,i,j)print(count)102. 沉没孤岛
和上一题差不多，尝试自己做做代码随想录
在上一题的基础上修改
direction=[[0,1],[0,-1],[1,0],[-1,0]]
flag=Falsedef dfs(grid,x,y):global flagif flag==False:grid[x][y]=2else:grid[x][y]=0for i,j in direction:next_x=x+inext_y=y+jif next_x<0 or next_x>=len(grid) or next_y<0 or next_y>=len(grid[0]):continueif grid[next_x][next_y]==1:dfs(grid,next_x,next_y)if __name__=='__main__':n,m=map(int,input().split())grid=[]for i in range(n):grid.append(list(map(int,input().split())))for i in range(n):if grid[i][0]==1:flag=Falsedfs(grid,i,0)if grid[i][m-1]==1:flag=Falsedfs(grid,i,m-1)for j in range(m):if grid[0][j]==1:flag=Falsedfs(grid,0,j)if grid[n-1][j]==1:flag=Falsedfs(grid,n-1,j)for i in range(n):for j in range(m):if grid[i][j]==1:flag=Truedfs(grid,i,j)for i in range(n):for j in range(m):if grid[i][j]==2:grid[i][j]=1for row in grid:print(' '.join(map(str, row)))
