11.16 华为OD机考编程丨Python语言算法真题

华为OD机考邮件通知

题目1

 

11.16 华为OD机考编程丨Python语言算法真题

参考答案：

n, m = [int(i) for i in input().split()]

list = []
for i in range(n):
list.append([int(i) for i in input().split()])

def numIslands(grid) -> int:
def dfs(grid, i, j):
if not 0 <= i < len(grid) or not 0 <= j < len(grid[0]) or grid[i][j] == 0: return
grid[i][j] = 0
dfs(grid, i + 1, j)
dfs(grid, i-1, j-1)
dfs(grid, i-1, j+1)
dfs(grid, i, j + 1)
dfs(grid, i - 1, j)
dfs(grid, i, j - 1)
dfs(grid, i+1, j-1)
dfs(grid, i+1, j+1)
count = 0
for i in range(len(grid)):
for j in range(len(grid[0])):
if grid[i][j] == 1:
dfs(grid, i, j)
count += 1
return count

ans = numIslands(list)
print(ans) #华为机考 #华为OD #华为od
#华为od招聘 #互联网大厂算法 #大厂算法 #华为算法 #华为编程语言 #Python #编程

互联网求职达人，热心分享互联网招聘经验~