我正在学习算法,并在解决这个问题,该问题是找到区域的数量。我尝试使用Python进行深度优先搜索,但出现了调用堆栈溢出错误。有人可以告诉我实现中的缺陷以及如何克服它吗? 代码如下:
def findCircleNum(A):
count = 0
def dfs(row, column):
if row < 0 or column >= len(A[0]) or row >= len(A) or column < 0:
return
if A[row][column] == 0:
return
A[row][column] = 0
for i in range(row-1, row+2):
if i >= 0 and i<len(A) and A[i][column] == 1:
dfs(i, column)
for i in range(column-1, column+2):
if i >= 0 and i<len(A[0]) and A[row][i] == 1:
dfs(row, i)
for row in range(len(A)):
for column in range(len(A[0])):
if A[row][column] == 1:
dfs(row, column)
count += 1
return count
findCircleNum(m)
输入的数据是一个全为1的100x100矩阵。
出现的错误信息是:
RuntimeError: maximum recursion depth exceeded
谢谢!