干净的方法来写这篇文章

Question

嗨，我正在编写Python功能，当我尝试用孔进行测试时，它显示了：R0912：太多的分支（20/12）（Too-Many-Branches）。我应该如何在清洁剂下面编写此代码？

rows = len(board)
cols = len(board[0])
count = 0
copy_board = deepcopy(board)
for i in range(rows):
    for j in range(cols):
        if check(i - 1, j - 1, rows, cols):
            if copy_board[i - 1][j - 1] == 1:
                count += 1
        if check(i - 1, j, rows, cols):
            if copy_board[i - 1][j] == 1:
                count += 1
        if check(i - 1, j + 1, rows, cols):
            if copy_board[i - 1][j + 1] == 1:
                count += 1
        if check(i, j - 1, rows, cols):
            if copy_board[i][j - 1] == 1:
                count += 1
        if check(i, j + 1, rows, cols):
            if copy_board[i][j + 1] == 1:
                count += 1
        if check(i + 1, j - 1, rows, cols):
            if copy_board[i + 1][j - 1] == 1:
                count += 1
        if check(i + 1, j, rows, cols):
            if copy_board[i + 1][j] == 1:
                count += 1
        if check(i + 1, j + 1, rows, cols):
            if copy_board[i + 1][j + 1] == 1:
                count += 1
        # Apply the rule to each cell
        if count < 2 or count > 3:
            board[i][j] = 0
        elif count == 3:
            board[i][j] = 1
        # Reset the count for the next cell
        count = 0

Answer 1

列出两个列表：
dx = [-1，-1，-1，0，0，1，1，1，1]
dy = [-1，0，1，-1，1，1，1，0，1]

然后您可以将if零件写为：

for k in range(len(dx)):
    if check(i+dx[k], j+dy[k], rows, cols) and copy_board[i+dx[k]][j+dy[k]]:
         count+=1