Python 2d列表值检查

时间:2017-11-25 14:14:07

标签: python list 2d

以下脚本在python中生成一个二维列表:

matrix = [[0 for row in range (5)] for col in range (5)]


i = 2
matrix[i][i] = 1
matrix[i+1][i] = 1
matrix[i][i+1] = 1
matrix[i+1][i+1] = 1


for row in matrix:
    for item in row:
        print(item,end="   ")

    print()
    print()

生成的2d列表如下所示:

0   0   0   0   0   

0   0   0   0   0   

0   0   1   1   0   

0   0   1   1   0   

0   0   0   0   0 

如何才能找到一个具有相同数字(数字必须为1)的正方形?具有相同编号的正方形必须为2x2

3 个答案:

答案 0 :(得分:1)

你可以遍历行和单元格,并且对于每个左上角,检查一个单元格的正方形是否都等于1,如果是,则返回True:

def has_square(seq):
    for row, line in enumerate(seq[:-1]):
        for col, cell in enumerate(line[:-1]):
            if cell == 1:
                if seq[row][col+1] == 1 and seq[row+1][col] == 1 and seq[row+1][col+1] == 1:
                    return True
    return False

有方形==真:

seq = [[0, 0, 0, 0, 0],
       [0, 0, 0, 0, 0],
       [0, 0, 1, 1, 1],
       [0, 0, 1, 1, 0],
       [0, 0, 0, 0, 0]]

has_square(seq)

有方形==错误:

seq = [[0, 0, 0, 0, 0],
       [0, 0, 0, 0, 0],
       [0, 0, 1, 1, 1],
       [0, 0, 1, 0, 0],
       [0, 0, 0, 0, 0]]

has_square(seq)

它相当粗糙,并没有很好地概括,但做了你想要的:确定一系列序列是否有四个方格。

答案 1 :(得分:1)

我们可以遍历矩阵中的每个元素,直到我们找到1.如果遇到1,那么我们可以检查它的邻居元素是否包含1,因为如果我们没有遇到1那么它正在形成的矩阵和它的邻居不是我们感兴趣的。

以下是执行此操作的代码:

def check_matrix(i,j):
    if matrix[i][i+1] ==1 and matrix[i+1][j]==1 and matrix[i+1][j+1]==1:
        return True
    else:
        return False

for i in range(5):
    for j in range(5):
        if matrix[i][j] == 1:
            check = check_matrix(i,j)
            if check == True:
                print('found at index',i,j)

此程序将在矩阵中检查1,如果遇到1,则检查它的相邻元素为1,如果全部为1,则返回True,否则返回False。

答案 2 :(得分:1)

如何轻松定制?

width = 5 # Width of grid
height = 5
square_w = 2 # Width of square you want found
square_h = 2
square_coords = []
avoid = [0] # This number doesn't count as a square
grid_list = [0, 0, 0, 0, 0,
             0, 0, 0, 0, 0,
             0, 0, 1, 1, 0,
             0, 0, 1, 1, 0,
             0, 0, 0, 0, 0] # Grid

# ONLY EDIT ABOVE /\ /\ /\

conv_list = []
for rep_h in range(height): # Convert grid
    conv_list += [[0] * width]
    for rep_w in range(width):
        conv_list[rep_h][rep_w] = grid_list[rep_h*width+rep_w]

for rep_h in range(height-square_h+1): # Find squares
    for rep_w in range(width-square_w+1):
        square_vis = True
        if not conv_list[rep_h][rep_w] in avoid:
            square_val = conv_list[rep_h][rep_w]
            for h in range(square_h):
                for w in range(square_w):
                    if conv_list[rep_h+h][rep_w+w] != square_val:
                        square_vis = False
            if square_vis:
                square_coords += [[rep_h, rep_w]]

print(square_coords) # Print result (Starting coordinates, AKA top left of box found)