【发布时间】:2017-03-01 17:00:42
【问题描述】:
我正在创建一个程序,该程序将创建一个网格,该程序将 除了您在输入处分配的矩阵数组的位置。
代码:
def onbekende_naam(hoogtes):
print(hoogtes)
i = 0
j = 0
pos1 = set()
for hoogtes_subs in hoogtes:
j = 0
for hoogtes in hoogtes:
print("i = " + str(i))
print("j = " + str(j))
pos1.add((i, j))
print pos1
j += 1
i += 1
#pos1.add((i, j))
return pos1
#verwerking
print (onbekende_naam(hoogtes))
输入:
4 4
1 2 3 4
5 6 7 8
9 1 2 3
4 5 6 7
12 1
输出:
[['1', '2', '3', '4'], ['5', '6', '7', '8'], ['9', '1', '2', '3'], ['4', '5', '6', '7']]
i = 0
j = 0
set([(0, 0)])
i = 0
j = 1
set([(0, 1), (0, 0)])
i = 0
j = 2
set([(0, 1), (0, 0), (0, 2)])
i = 0
j = 3
set([(0, 1), (0, 3), (0, 0), (0, 2)])
i = 1
j = 0
set([(0, 1), (0, 3), (0, 0), (0, 2), (1, 0)])
i = 1
j = 1
set([(0, 1), (0, 0), (0, 2), (1, 0), (0, 3), (1, 1)])
i = 1
j = 2
set([(0, 1), (1, 2), (0, 0), (0, 2), (1, 0), (0, 3), (1, 1)])
i = 1
j = 3
set([(0, 1), (1, 2), (0, 0), (0, 2), (1, 3), (1, 0), (0, 3), (1, 1)])
i = 2
j = 0
set([(0, 1), (1, 2), (0, 0), (0, 2), (2, 0), (1, 3), (1, 0), (0, 3), (1, 1)])
i = 3
j = 0
set([(0, 1), (1, 2), (0, 0), (3, 0), (0, 2), (2, 0), (1, 3), (1, 0), (0, 3), (1, 1)])
set([(0, 1), (1, 2), (0, 0), (3, 0), (0, 2), (2, 0), (1, 3), (1, 0), (0, 3), (1, 1)])
如您所见,当 i 值大于 2 时,它会停止递增 j
我在这方面还很陌生,所以感谢您的帮助
【问题讨论】:
-
请在您的问题中包含代码作为格式化文本,并确保它是minimal reproducible example。
-
哈,看懂代码正常复制粘贴吗?
标签: python arrays for-loop matrix