字節跳動2018年校招筆試題

1 思路 DFS 找出最大連通分量 代碼 mat = [] mark = [] mn = input().split(',') m = int(mn[0]) n = int(mn[1]) direction = [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)] def valid_pos(row, c

>>阅读原文<<