我使用的是python3.6。我已经快速浏览了google和stack overflow,但是我还没有看到一个关于我的问题。问题是,我的函数应该查找活动邻居的数量,但返回了错误的值(但只是有时)。你知道吗
代码如下:
def neighbourCount(i, j):
neighbours = 0
try:
if grid[i-1][j-1] == "1":
neighbours += 1
except:
pass
try:
if grid[i-1][j] == "1":
neighbours += 1
except:
pass
try:
if grid[i-1][j+1] == "1":
neighbours +=1
except:
pass
try:
if grid[i][j-1] == "1":
neighbours += 1
except:
pass
try:
if grid[i][j+1] == "1":
neighbours += 1
except:
pass
try:
if grid[i+1][j-1] == "1":
neighbours += 1
except:
pass
try:
if grid[i+1][j] == "1":
neighbours += 1
except:
pass
try:
if grid[i+1][j+1] == "1":
neighbours +=1
except:
pass
return(neighbours)
grid = [
["0","0","0","0","0","0","0","0","0","0"],
["0","0","1","0","0","0","0","0","0","0"],
["0","0","1","0","0","0","0","0","0","0"],
["0","0","1","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"]
]
newGrid = [
["0","0","0","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"],
["0","0","0","0","0","0","0","0","0","0"]
]
game = 1
while game == 1:
for i in range(0,10):
print(*grid[i], sep=' ')
numNeigh = []
for i in range(0,10):
row = []
for j in range(0,10):
neighbours = neighbourCount(i, j)
if grid[i][j] == "1" and ( neighbours>1 and neighbours<4 ):
newGrid[i][j] = "1"
if grid[i][j] == "1" and ( neighbours<2 or neighbours>3 ):
newGrid[i][j] = "0"
if grid[i][j] == "0" and neighbours == 3:
newGrid[i][j] = "1"
row.append(neighbours)
numNeigh.append(row)
for i in numNeigh:
print(i)
for i in newGrid:
print(i)
print("\n\n")
grid = newGrid
input()
这是输出(第一块:网格数组)(第二块:每个单元格的邻居)(第三块:newGrid数组):
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 1 1 1 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[1, 2, 3, 3, 2, 0, 0, 0, 0, 0]
[1, 2, 4, 2, 2, 0, 0, 0, 0, 0]
[1, 1, 2, 1, 1, 0, 0, 0, 0, 0]
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
['0', '0', '0', '0', '0', '0', '0', '0', '0', '0']
['0', '0', '1', '1', '0', '0', '0', '0', '0', '0']
['0', '1', '0', '1', '0', '0', '0', '0', '0', '0']
['0', '0', '0', '0', '0', '0', '0', '0', '0', '0']
['0', '0', '0', '0', '0', '0', '0', '0', '0', '0']
['0', '0', '0', '0', '0', '0', '0', '0', '0', '0']
['0', '0', '0', '0', '0', '0', '0', '0', '0', '0']
['0', '0', '0', '0', '0', '0', '0', '0', '0', '0']
['0', '0', '0', '0', '0', '0', '0', '0', '0', '0']
['0', '0', '0', '0', '0', '0', '0', '0', '0', '0']
(注意:我还有一个用于“newGrid”的2D数组,它与“grid”相同,但只有“0”)
中间的区块显示每个位置的邻居数量,但不是在第三行显示“1,1,2,1,1,0,0…”,而是显示“1,2,4,2,2,0,0…”
您的问题可能在于创建
newGrid
的行。除非正确地创建grid
(深度副本)的副本,否则元素将指向相同的列表(浅层副本)。所以当你改变newGrid
时,grid
也在改变。要正确创建grid的副本,请将newGrid
行更改为:收件人:
注意:使用numpy将在调用numpy数组的
copy
方法时自动创建适当的深度副本。相关问题 更多 >
编程相关推荐