在python中优化DFS

problem 这就是寻找区域的数量。我尝试了使用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)

错误为get is:

RuntimeError: maximum recursion depth exceeded