题目描述:
一个矩阵,5*5,取相邻(二个成员有一个边是相同的)的6个,输入一个6个成员列表,判断是否满足?
矩阵成员如下:
[[1,2,3,4,5],
[11,12,13,14,15],
[21,22,23,24,25],
[31,32,33,34,35],
[41,42,43,44,45]].
输入描述:
包含6个矩阵成员数组,如:1,2,3,4,5,11以一个空格分隔,支持多行
1,2,3,4,5,11
1,2,11,14,25,15
输出描述:
满足输出1,否则输出0,每一行输入一个输出
1
0
def label(df, num):
result = []
found = False
for i in range(len(df)):
for j in range(len(df[i])):
if num == df[i][j] and not found:
found = True
result.append(i)
result.append(j)
if not found: