中级农民
- 积分
- 103
- 大米
- 颗
- 鳄梨
- 个
- 水井
- 尺
- 蓝莓
- 颗
- 萝卜
- 根
- 小米
- 粒
- 学分
- 个
- 注册时间
- 2018-12-30
- 最后登录
- 1970-1-1
|
感觉挺有意思,写了一下
def check_connected_region(matrix):
M, N = len(matrix), len(matrix[0]). check 1point3acres for more.
visited = dict()
def check(i, j):
cur_visited = set()
queue = [[i, j]].google и
cur_visited.add((i, j)). Χ
target = matrix[j]
while queue:
cur_i, cur_j = queue.pop(). ----
for d_i, d_j in [[0, 1], [0, -1], [1, 0], [-1, 0]]:
next_i, next_j = cur_i+d_i, cur_j+d_j
if next_i<0 or next_i>=M or next_j<0 or next_j>=N \
or (next_i, next_j) in cur_visited \
or matrix[next_i][next_j] != target:
continue
cur_visited.add((next_i, next_j)). 1point3acres.com
queue.append([next_i, next_j])
if len(cur_visited) >= 3:
for pos in cur_visited:. Χ
visited[pos] = True. .и
else:
for pos in cur_visited:
visited[pos] = False
for i in range(M):
for j in range(N):
.google и if (i, j) not in visited:. 1point3acres.com
check(i, j)
for (i, j), val in visited.items():
if val == True:
matrix[i][j] = 0
return matrix
matrix = [[1,1,1,2,2],. Waral dи,
[3,3,3,0,0],. 1point 3acres
[3,3,1,1,2],
[2,1,3,5,6]]
print(check_connected_region(matrix))[/i] |
|